Color quality and packet shaping features for displaying an application on a variety of client devices

ABSTRACT

In a client-server architecture, data transmission performance enhancing features and mechanisms are described, including a color quality approach and a packet shaping approach. A method includes a color quality data transformation including: selecting a quality level to apply to a set of image data having a number of significant color bits defining an initial number of possible colors; applying a pixel mask to the set of image data, the initial number of possible colors reduced to a smaller number of possible colors as a function of the quality level; loading the set of image data into an output buffer; and sending the set of image data from the output buffer to a display engine. Another method includes a packet shaping data structure transformation including if i) a total network time, defined by a total time of requests in a pending request queue, is equal to or greater than a current round trip time, defined by twice a current latency, and ii) a total request time, defined by a sum of a total time of requests in the pending request queue and a total time of requests in a transmitted request queue, minus the total network time is equal to or less than half a preset limit, then forming a shaped packet by associating a first data portion with a second data portion and a header.

CROSS-REFERENCE TO RELATED INVENTIONS

[0001] This application claims the benefit of priority under 35 USC 120 of and is a continuation-in-part of both utility patent application U.S. Ser. No. 09/282,765 filed Mar. 31, 1999, and utility patent application U.S. Ser. No. 09/190,757, filed Nov. 12, 1998, now abandoned. This application claims the benefit of priority under 35 USC 119(e) of both provisional patent application U.S. Serial No. 60/080,790, filed Apr. 6, 1998, and provisional patent application U.S. Serial No. 60/065,521, filed Nov. 13, 1997 The entire contents of all four of these patent applications are hereby incorporated by reference for all purposes.

COPYRIGHT NOTICE

[0002] Copyright 1997-2002 Tarantella, Inc. A portion of the disclosure of this patent document contains materials which are subject to copyright protection. The owner has no objection to the facsimile reproduction by anyone of the patent document or patent disclosure, as it appears in the United States Patent and Trademark Office patent file or records, but otherwise reserves all rights, including all copyright rights, whatsoever.

BACKGROUND OF THE INVENTION

[0003] 1. Field of the Invention

[0004] The present invention relates to networked data processing environments using a client/server architecture, and, in particular, to client-server systems where there exist one or more clients of varying capability connected via network connections of varying bandwidth and latency to one or more servers providing application services or database services to the connected clients.

[0005] 2. Background Information

[0006] Until the 1980s the computer network typically was used as a means of connecting to a large mainframe environment using dedicated hardware terminals and proprietary protocols. Next UNIX servers grew in usage and with it came standardization of the networking protocols, in particular TCP/IP (Transmission Control Protocol/Internet Protocol). Simultaneously, there was a shift in the computing paradigm towards client/server architectures. This allowed the processing power to be distributed over the network and not be limited to servers which could not scale to meet the growing number of users and their increasing demands. This lead to the need for clients to become more intelligent and powerful. Significant desktop clients came into use: Microsoft Windows. Each iteration of this operating system brought about more functionality requiring more powerful desktop clients. More and more software had to be installed on these clients leading to what is termed “fat clients” and each client required individual configuration. People began to find that the amount of time and money required to maintain these powerful clients was increasing.

[0007] High availability networks together with hardware and software needed to support such networks have become the norm. In these environments there is not a homogeneous structure of one type of server and one type of client, but a variety of such devices. Within a network there is a wide variety or servers and clients. Upgrades and new applications for this diverse mix of clients usually requires that each client be individually upgraded. Also each user has specific needs on the desktop client: configuration, security, access control, mobility. The information services department provides this by administering each client separately. If remote offices are involved, costs to do this increase significantly. Performance in this heterogeneous client network must also be maintained. Slow performance takes up time and money. Networks vary in bandwidth, e.g. modem links, ATMs, Frame Relays, etc.

[0008] The World Wide Web (the “Web”) has come to the forefront in the current era of the Internet/Intranet and networks have become an integral part of day to day work. Modem speeds double every year and 100 Mbit/sec Local Area Networks have arrived. The Web is now a well-accepted medium for publishing information, in the form of text and graphics (including sound and video). Web programming languages such as Java, JavaScript, and CGI have now extended the Web to applications. This is fine for new applications but existing applications also need a route into this world.

[0009] Existing applications have either had a character-based or windows-based user interface. Now such applications need a web user interface. The web user interface provides a presentation layer to the user of the application. It must provide an input/output method for the user to interact with the application. There are a number of ways to do this including: (1) HTML (HyperText Markup Language) replacement of the current user interface; (2) Non-Java plug-ins; and (3) Java-based emulation. The first solution involves rewriting the application. The second involves installing more software on the clients leading to “fat clients”. The third is preferred.

[0010] A large number of vendors offer a character or graphical emulation package that runs on desktop clients such as Windows, UNIX, etc. These emulators could be rewritten in Java and such Java emulator will run on just about any client. However, this approach leads to fat Java clients. For performance reasons, users will not want to wait for large Java applets to download. These Java applets will grow in size as users demand more and more functionality. Storing these Java applets locally solves the performance problem but leads to fat clients. If state information is stored on the client leading each client to have its own particular configuration parameters, the problem of fat clients is further exacerbated and each client is being managed individually rather than from a central place on the server.

[0011] Web browsers have an API (Application Programmers Interface) enabling software developers to provide helper applications that allow users to run applications or view unsupported document types on their client platform. These are termed “browser plug-ins”. They are both platform-specific and browser-specific. For example, for two platforms (Windows and UNIX) and two browser types (Netscape and Microsoft), four different implementations of the plug-in would be needed. This type of solution is not cross platform and the majority of these plug-ins are proprietary (e.g., Microsoft ActiveX) locking users into vendor specific solutions.

[0012] Once the web display of an application is possible, the next step is to make it available to all users. A number of methods that could be used include: (1) local installation; (2) push technology; (3) on-demand access. Local installation involves an administrator installing the application or connectivity software on every single client. This is disadvantageous in that it makes the clients more difficult and costly to manage and leads to fat clients. Push technology involves storing all the files and data associated with users and applications on a server and transmitting them out via virtual channels on a network to clients. Where all storage is on the sever, users experience poor performance in waiting for applets and applications to execute, or downloads are cumbersome and in some cases unusable. Local storage of applications and state information is used to improve performance. This approach starts off well by using a central server but when applications and any associated state are stored on the client, the fat client problem arises. With on-demand access as used in the present invention, user state, applications, connectivity software and the associated configuration data are stored on a server. Applets are downloaded on demand when the clients request an action, such as start up an application. All state information is kept on the server and can then be managed centrally rather than individually on each client. Keeping state information on the server also makes the client resilient. If the client connection is lost or the client itself is replaced, nothing is lost and no replication is needed.

[0013] Next the applications and data must be made available to selected users in a secure manner. For manageability, this is done centrally on a server and made available by the most common medium to all users, the Web. But this raises more questions:

[0014] What do web pages on that server have to contain?

[0015] What editor has to be used?

[0016] How do you make it available to selected users or groups of users?

[0017] Are there different web pages for different types of users?

[0018] Where does the user profile and application configuration reside?

[0019] Do users authenticate themselves every time they want to run applications?

[0020] How is the authentication done?

[0021] What if the user is already authenticated on the server and does not want to do again and again for each application?

[0022] What if all of this information is already available and duplication is not desired?

[0023] As the above list shows, providing a display mechanism via Java emulation is only a partial solution to web-based delivery of applications.

[0024] To achieve optimal performance on all networks is difficult. Protocols are designed with specific functions in mind, e.g., inter-process communication, graphics rendering, etc. Protocols are rarely designed with the goal of providing uniform performance over complex network routes that have different permutations of bandwidths. To choose the right protocol a number of assumptions could be made. For a high bandwidth network, such as a fast LAN with low latency, the X protocol works well but is unusable over a slow modem link. For a low bandwidth network, such as a slow WAN or modem connection, compression can be used to optimize performance. The ICA protocol of Citrix Systems, Inc. works well over a slow modem connection but is inefficient on a fast LAN connection.

[0025] It would be advantageous to be able to deliver upgrades to existing applications or roll out new applications to diverse clients; to be able to centralize the administration of clients and their applications; to have a system that is able to adapt itself to the network environment it works in; and to provide optimal performance for diverse clients that are connected to the network via routing connections of differing bandwidth and performance.

SUMMARY OF THE INVENTION

[0026] The inventive method is used in a client server network that provides at least one application service for selection by a user via a client device having a display engine operating thereon. The method permits the efficient operation of the application without overloading the connection to the client device. The method transmits to and displays on the display device of the client device, display requests of the requested application service which are not supported by the client device. It does this by using two major processes, a display engine and a protocol engine. The display engine is downloaded from the server and executes on the client device a display engine. Next, the protocol engine is initializing with parameters of the client device comprising display operations supported by the client device, the relative cost of each supported operation and a local performance factor and parameters of the connection from the server to the display engine comprising bandwidth and latency. The protocol engine maintains a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device. Each request has a corresponding relative cost and request time determined by the relative cost and the local performance factor. The protocol engine also maintains a total request time for all requests in both queues and maintains a total network time for all requests in the second queue.

[0027] The inventive universal application server, also termed an application broker, is added in a nondisruptive manner to an existing computer network environment forming a second server tier intermediate the application servers tier on a third tier and the client devices on a first tier. The system provides the following elements:

[0028] a shared database that is used to describe the location of the application programs, the application servers, the users of the system and a description of which users are provided with access to which application programs;

[0029] a set of protocol engines processes which support industry standard display protocols (X11, telnet, VT220, etc.) which form the protocols as used by the application programs;

[0030] a set of display engines processes which are designed to operate within the various client device environments and which communicate with the PE to provide presentation and user interaction services with the users of the client devices;

[0031] a set of delivery servers which can be used to deliver the display engines to the client devices on demand; and

[0032] a set of management engines—a data store engine, a status engine, a session manager engine, an administrative engine that allow manipulation of the shared database and control of the operation of the system.

[0033] Once the application broker has been installed into the existing client server environment it operates in the following manner. Management processes define and maintain the shared database. This consists of making entries for each user of the system for each application server and for each application program. Users connect to the application broker from their client devices and are authenticated against the database. Display engine components are automatically downloaded to the client device, and are used to present the user with a webtop (visual menu) of applications that are available for execution. The contents of the webtop are specific to the user and are constructed dynamically from the database. The user chooses which applications to run. This information is passed from the display engine running on the client device to the universal application server. The universal application server, using information stored in the database determines the location of the application program and communicates using industry standard protocols with the appropriate program to take place. The application program launches and is instructed to perform usr interaction over a standard protocol by the universal application server.

[0034] The application broker also arranges to create an instance of the appropriate protocol engine to handle the specific protocol used for a number of applications, such as X-windows applications. It also downloads a suitable display engine to the client device to interact with the user. The protocol engine takes output requests from the application program and converts them into a form that is suitable for use by the downloaded display engine. This information is then forwarded to the display engine where it then converts the information into a form suitable for display within the client device environment. The user interactions with the display engine and the result of these actions (typing, mouse manipulation etc.) are transmitted to the protocol engine. The protocol engine converts these user inputs into the standard protocol used and passes them to the application program.

[0035] As set forth in the co-pending application referenced above, the protocol engines and display engine processes transmit to and display on the display device of the client device, display requests of the requested application service which are not supported by the client device. The protocol engine is initialized with parameters of the client device comprising display operations supported by the client device, the relative cost of each supported operation and a local performance factor and parameters of the connection from the server to the display engine comprising bandwidth and latency. The protocol engine maintains a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device. Each request has a corresponding relative cost and request time determined by the relative cost and the local performance factor. The protocol engine also maintains a total request time for all requests in both queues and maintains a total network time for all requests in the second queue.

[0036] While the total request time is less than a predetermined first value, the protocol engine accepts new pending requests from the application service that are to be displayed on the client device. The protocol engine executes the new pending display request to create an image to be displayed on the client device, saves the resulting image to memory and determines for the image its relative cost and its corresponding request time based the local performance factor received from the display engine. The protocol engine also converts the new pending display request from the application service into a sequence of converted requests that are supported by the client device, places the sequence of converted requests in the first queue, determines for each converted display request in the sequence its relative cost and its corresponding request time based on the local performance factor, and increments the total request time by the request time of each added request. Further while the total network time is less than a predetermined second value optimizing the first queue using a merge optimization occurs when the request times of the pending requests in the first queue exceed a predetermined third value. The total request time is updated based on the results of the merge optimization. Next a pending request is read from the first queue and labeled with a first sequence identifier. Each read request is then encoded for transmission to the display engine over a network connection. A copy of the optimized request is placed into the second queue and the total network time is incremented by the request time for the newly added request. The encoded display request is transmitted to the display engine. The display engine unencodes the received converted display request and displays it on the client device. Next it generates a second sequence identifier corresponding to first sequence identifier of the displayed request; and periodically transmits to the protocol engine the second sequence identifier of the last received display request displayed on the client device.

[0037] Upon receipt of the second sequence identifier, the protocol engine further comprises the steps of:

[0038] deleting from the second queue the display request whose first sequence identifier is the same as the second sequence identifier and all pending displayed requests in the second queue having first sequence identifiers that are prior to such second sequence identifier; and

[0039] decrementing from the total request time and from the total network time the request time values of each of the deleted display requests.

[0040] The application broker using the information contained in the data store regarding the application programs and the application servers used to run them is able to keep track of which third tier server is actually running the application program. The number of all applications running on each application server is tracked. At launch time of the application program, the application broker chooses the application server from the list associated with the application that currently has the lowest number of applications running on it. This selection process provides a load balancing mechanism for the application servers.

[0041] In the inventive process various optimization techniques can be used based on a performance factor that is determined for the client device and various encoding techniques can be implemented depending on the bandwidth and latency of the network connection to the client device. Preferably, the process is programmed using a machine independent programming language.

BRIEF DESCRIPTION OF THE DRAWINGS

[0042] For a better understanding of the invention reference may be made to the preferred embodiments of the invention shown in the accompanying drawings where:

[0043]FIG. 1 illustrates a Universal Application Server (the “UAP”) system comprised of a client/server network showing the interconnection of the UAP server to other applications and database servers and to a diverse set of clients.

[0044]FIG. 2 is an illustration of the Adaptive Internet Protocol (AIP) Link as implemented in the UAP system.

[0045]FIG. 3 shows the processes operating in the display engine and protocol engine components of the present invention.

[0046]FIG. 4 is a more detailed data flow diagram of the AIP link of the present invention.

[0047]FIG. 5 is a table of sample AIP requests.

[0048]FIG. 6 presents a table of AIP request translations and a table of sample relative costs for performing an AIP request.

[0049]FIG. 7A and FIG. 7B illustrate a flow diagram of the startup process of the application broker system.

[0050]FIG. 8 illustrates an implementation of a color quality feature.

[0051]FIG. 9 illustrates an implementation of a packet shaping feature.

[0052] FIGS. 10A-10C illustrate three examples of packets.

DETAILED DESCRIPTION OF THE INVENTION

[0053] Overview of a Universal Application Server System

[0054] As used in this application the term “engine” is used to refer to a process, method or series of related processes or methods for performing certain actions. For example the session engine is a process that is used to control a current session between the server and a client device. Also the same or similar item occurring in more than one figure will carry the same or similar numeric designation.

[0055] As shown in FIG. 1, the network 10 is comprised of three tiers used to illustrate the connections of the various inventive processes and routing of data information among the various processes and components comprising the network. The first tier 12 contains a variety of diverse client devices, generally indicated at 14, having different interfaces, such as PC 14A, UNIX computer 14B, Network Computer 14C, all illustrated as having a Java Virtual machine interface 16 to the second tier 40, or a thin client 14D shown having a browser interface 18. The inventive processes are also useable in a standard Microsoft Windows environment that use interfaces such as Win16 and Win32. In addition, an administrative computer 20, illustrated as a network computer, is also grouped in first tier 12 and is in communication with processes running on second tier 40.

[0056] The second tier 40 comprises UAP server 50 having various engines or processes executing thereon together with various interfaces to first tier 12 and to third tier 80. The interfaces to first tier 12 include X windows interface 52, character based interface 54, Java interface 56, and HTML interface 58. The interfaces to third tier 80 include an X Windows interface 60, terminal emulators 62, web server 64, and lightweight directory access protocol (LDAP) interface 66. The third tier 80 includes the various application servers, generally indicated at 82, including UNIX X Windows server 82A, Windows NT server 82B, UNIX and IBM character-based application servers 82C, directory services servers 82D, the Internet 82E and various data base servers 82F. The UNIX X window server 82A and the Windows NT server 82B interface to the second tier 40 via X Windows interface 60. The UNIX and IBM character-based application servers 82C interface via appropriate terminal emulators 62. The web server 64 provides the interface to the Internet 82E while the directory services server 82D uses the LDAP interface 66. Although all of the application servers are shown in FIG. 1 as being in a single tier, it should be realized that the application servers can also function as clients to other servers not shown and that the requested application may reside in a server located elsewhere in the network. Also shown are User Session Manager engine 70 which controls active sessions between the client devices 14 and the application servers 82 and the Administration and Management manager engine 72 which controls the operation and administration of UAP server 50 and which is in communication with the administrative computer 20 operated by a system administrator.

[0057] Client connections and requests, 30, are routed to the appropriate interfaces on UAP server 50 which in turn processes them using one of more of the UAP engines described below and obtains the requested service or data from the appropriate application server 82. UAP server 50 then returns to the client devices 14 display requests from the requested application and other data. UAP server 50 resides on a host or server on the network that has a web server running on it. It can be viewed as a black box sitting somewhere on the network that enables any client to access any service by providing the intelligence needed to do this.

[0058] A variety of naming standards and methods are used to access resources on the network. Computers on the Internet use conventions such as Domain Name Service (DNS) or Windows Internet Naming Service (WINS). File naming conventions are tied to operating systems of which there are many. For example, Microsoft operating systems use the Universal Naming Convention (UNC). These resources are disparate and different entry points and methods are needed to access them. The UAP server provides an integration point for a wide variety of naming standards by federating the name spaces. It provides a single point of entry to access any network resource. The X/Open Federated Naming (XFN) based scheme is the preferred naming standard to permit such integration amongst these variety of naming services and standards.

[0059] Large and complex information about network resources is usually kept by directory servers, for example, Novell® NDS™, Microsoft Active Directory, Netscape Directory Server™. UAP server 50 does not provide a complete replacement or duplication of these services. UAP server 50 provides a thin layer that interfaces into these services using LDAP (Lightweight Directory Access Protocol). LDAP is a current de facto industry standard interface to directory services. By doing this UAP server 50 avoids duplication of information and functionality which may already be present on the network. It would be an unnecessary and time-consuming process to replicate this information. For example, if a thousand users are already set up, the use of the LDAP layer allows use of this information by UAP server 50 and administrative engine 72, rather than making administrators recreate it and double the maintenance load.

[0060] As illustrated in FIG. 2, UAP server 250 contains the following processes: administration engine 272; status manager engine 274, protocol engines, 276A-276C, display engines 278A-278C; web server 264 and webtop storage 268 for the storage of user webtops; data store 273 containing various user and system data such as the LDAP protocol, user passwords, user application objects, startup engine, and other data related to the operation of UAP server 50, data store engine 271 and one or more session managers 270, which can be configured to permit suspendable and resumable sessions. Login port 251, reconnect port 253, a plurality of session ports 255 are provided for communication with client devices. Display engines, generally designated 278, are stored on UAP server 250 and are downloaded to client device 214 when needed. Client device 214 is a computer system that has a display and input devices such as a keyboard, mouse, touchpad, etc., as is known in the art. Shown in the third tier 280 are three application servers, generally designated 282, X Windows server 282A, Windows NT server 282B, and character-based server 282C.

[0061] UAP server 250 provides administrative engine 272. Only authorized administrative users have the ability to run this process. The main functions of the administrative engine 272 are:

[0062] Publishing applications and documents to users

[0063] Organizing user profiles (what each user is allowed to access)

[0064] Viewing and changing the contents of the organizational hierarchy

[0065] Monitoring and controlling sessions, including viewing which users are logged on and what applications are running, and stopping applications

[0066] Configuring the UAP server settings such as logging and diagnostic specification, authentication mechanisms and file locations

[0067] Sitting at the heart of UAP server 250 is a suite of server engines or processes that coordinate all functions. These are status manager engine 274, datastore engine 271, session manager engine 270, protocol engines, generally designated 276, and the display engines 278. These engines cooperate to provide the central point of access to the client devices and handle the following:

[0068] Security management

[0069] Retrieval and storage of state associated with users and applications

[0070] Invocation of applications and their supporting display mechanisms

[0071] Session management

[0072] Status manager engine 274 provides initialization and control over all the other server engines. It is the first process that is launched when UAP server 250 starts up. It is designed to manage all other processes and act as a central point of brokering requests and actions.

[0073] Datastore engine 271 provides the initial interface to a connecting client device. It controls the contents of datastore 273, which holds information about services, network devices, as well as users and their associated applications and data. UAP server 250 uses a bootstrap applet 221 that downloads itself to the client device 214 on demand from a user. This applet then connects to datastore engine 271, which provides an authentication service, after which requests can be issued to the datastore engine 271 to: generate webtops; configure the webtop; invoke applications; retrieve documents; and, if requested by the system administrator, view and modify the contents of the datastore itself for system administration.

[0074] The data store can be a hierarchy based upon the X500 standard. The major items contained with the database can be:

[0075] People. These represent the users of the system. The location of the person within the hierarchy can be used to reflect the organization of the company. In particular, it is possible to group people to provide for easy administration of people that have access to similar application programs. Information stored for a person includes authentication information such as application passwords and login password, a list of groups to which that person belongs and a list of applications that should be presented to that user.

[0076] Applications: These items represent the application programs that are deliverable by the system. The location of an application program within the hierarchy is used to determine which users will be presented with that application. Information present for an application includes, protocols used by the application (X11, Telnet, etc.), location of the application (application server name, location within the file system on that application server) and configuration information required to launch the application (environment settings for the application server, command line arguments, display size information, etc.)

[0077] Groups. These items are used to form convenient administration objects. They can be used to simplify the delivery of applications to sub-sets of users or to provide access of sets of applications.

[0078] The actual database itself can be federated and can access data from several sources. These sources can include directory services (via LDAP protocols), local system authentication information (passwords etc.), and dynamic state information (running applications etc.).

[0079] At any given time while UAP 250 server is active, session manager engine 270 contains dynamic information about which users are connected and the applications they are running. In addition, session manager engine 270 is responsible for invoking applications after the client device request has been processed by datastore engine 271. Session manager engine 270 can be viewed as the keeper of all live information in the UAP server 250. Session manager engine 270 tracks which applications are running on which application servers. At launch time of a given application, session manager 270 obtains the list of application servers capable of running this application and chooses the application server that can run the requested application and that currently has the lowest total number of applications running. This selection process provides a load balancing mechanism. More complex load balancing schemes can be used but the inventors have found that this process produces a reasonably even sharing of the processing load amongst the application servers.

[0080] Protocol engines 276A-276C and display engines 278A-278C provide the emulation necessary for the user to view and interact with applications. Preferably, UAP server 250 via session manager 270 associates one protocol engine and one display engine for each corresponding application type. They are invoked and the display engine is downloaded on-demand to the requesting client device. Protocol engines 276A-276C run on UAP server 250 and perform the bulk of the emulation by acting as a client of its associated application type running on the network. The protocol engine understands the standard protocols the application types currently use. X-windows type applications would use a protocol engine that is different than the protocol engine used for Microsoft Windows type applications. The appropriate protocol engine translates the standard protocol requests into an adaptive internet protocol that the display engine on the client device can display. Using this method existing applications continue to run on servers they are currently installed on, untouched and without any re-engineering or re-writes needed in order to function with the client device. Preferably, the protocol engines are implemented as native binaries to ensure optimal performance on UAP server 250.

[0081] Display engines 278A-278C are preferably Java applets that are downloaded on demand by the client device. The display engines are small in size—around 200 Kilobytes—and render the application on the client device display and allow input/output to the user. As a result the display engines are quick to download, even over low-bandwidth networks. The display engines know nothing about the state of the application that is being run. There is a display model mismatch between the existing application environments and the display model used on the display engine. Operations that are not supported on the display engine (e.g., plane-masking, logical operators etc.) are carried out on the protocol engine and sent down as supportable operations (e.g., bitmap copy from memory) to the display engine.

[0082] The most common mode of access to the UAP server is from web browsers. Users of UAP server 250 interact with applications and documents on the network using the web equivalent of a desktop—the webtop. UAP server 250 gathers all objects (applications, documents, etc) associated with a user and dynamically creates a web page to represent this information. This web page contains smart applets, preferably written in the Java programming language, represented as graphical icons (see 225A-225C). When the user clicks on these smart icons, requests are issued to invoke services or applications or view documents. The navigation model that is used in browsers involves going back and forward between pages. From time to time pages with applications running inside them may be out of view on the display screen of the client device. Browsers temporarily cache Java applets such as the display engine inside these pages that are out of view. After a certain amount of time these applets are cached out by the browser. UAP server 250 works around this problem by providing an automatic reconnect of the display engine without shutting down the application (as indicated at path P10 between display engines 278A-C and reconnect port 253).

[0083] UAP server 250 uses session manger engine 270 and sessions to provide and control the access and interaction of the user with the desired network application or database. A session is associated with each application or database the user may be running. An application session can be configured by administrators to be resumable. With a resumable session users can disconnect themselves from UAP server 250 but the resumable applications remain running. When the user reconnects to the session, the application is presented in the same state as it was when left. This reduces start up time for applications and allows client resilience. For example, some applications take a long time to start up. At other times, after starting the application, the user goes through a laborious route to a particular point, for example, a character-based data entry application with a large number of menu options or a processor intensive query or calculation. In a network-centric environment, the connection from client to server is critical. If the connection drops for any particular reason, for example, if a modem connection is interrupted, the server must be able to recreate the state associated with the client device when it reconnects. The suspend/resume facility of session manager 270 allows this to occur. During the configuration process, administrators can choose to disallow the resume facility, on a per application basis, to save server resources. For example, a simple calculator application is unlikely to need resuming. Administrators also have the ability to terminate application sessions while they are running.

[0084] Operation of the UAP Server

[0085] The process used by the UAP server to allow client device 214 to connect, deliver the client's webtop and run applications or view documents is illustrated in FIG. 2. Client device 214 connects to web server 264 as shown at path P1. Here the user is shown connecting to the web server 264 via a Java enabled web browser 218 but the user can also connect by other means including using a Java virtual machine running on the client device or use of a native binary application.

[0086] Web server 264 retrieves from data store 268 a web page containing UAP boot-strap applet 221 and returns it to web browser 218. Boot-strap applet 221 is executed on client device 214. This applet connects with datastore engine 271 via the log in port 251 as shown in path P2. Data store engine 271 then provides client device 214 with login applet 223 via path P2. Login applet 223 is executed on client device 214 and the user is authenticated to UAP server 250 using this applet. If the correct user-name and password are supplied, applet 223 issues a request to datastore engine 271 to search and find the webtop for that user. A webtop 225 is created dynamically using the objects associated with the user stored in datastore 273 and is loaded into browser 218 running on client device 214. For a new user, the system administrator provides the initial objects to be used in the construction of the web page together with the level of user privileges available to the user.

[0087] Session manager 270 can begin bottom up traversal of the data store hierarchy starting from the user and expanding any groups. During this traversal a list of applications specific to the user can be created. When the traversal is complete, the list of applications can form the set of applications to be made available to this user. Session manager 270 can transmit presentation data for the application set to the login applet 223 (this can include textual and graphical representations, i.e. a web page or webtop) that, in turn, presents the application set in a manner appropriate to client device 214. The user can choose an application to launch (via some sort of input device supported by client device 214.

[0088] When the user clicks one of the icons (225A-225C and preferably a smart Java icon) in webtop 225, the web page associated with that object is downloaded from web page store 268 and web server 264. If the object is an application, then the appropriate display engine for the client device is downloaded. In FIG. 2, three display engines 278A, 278B, and 278C are shown on web browser 218 indicating that this user is using three applications.

[0089] Each display engine 278 performs an initialization routine with client device 214 to determine supported display operations and display performance factors. Preferably, each display engine 278 contains a table 279 of display operations that are expected to be supported by the client device in its operating environment. The display engine performs a test of the client device to determine which of the display operations in the table can actually be performed on the client device and modifies table 279 to indicate which operations are supported on the client device 214. The modified table 279 is stored in the display engine and is also sent to UAP server 250 for further use.

[0090] The display engine also calculates a local performance factor or scaling factor for the client device to determine the relative cost of performing the supported display operations. Preferably, two bitmap copy operation tests are performed, i.e., data in memory is written to the display. In the first test, a small number of pixels, one or two, are written to from memory and the time to perform this operation is noted. This step is repeated an arbitrary number of times and an average time T_(small) is determined. This time, in microseconds, represents the overhead to work with a pixel. In the second test a larger image involving a larger number of pixels is copied from memory to the screen and the time to perform this T_(large) is noted. Next the Per Pixel Cost, PPC, is determined as follows:

PPC=[T _(large) −T _(small)]/[Number of pixels written in second test]

[0091] This local performance factor, PPC, is communicated to UAP server 250 for use by the protocol engine in determining request times for the requests found in the two queues.

[0092] Each protocol engine can use database engine 271 and session manager 270 to determine which application server to contact and the protocol to use to launch the application. Each protocol engine can connect with the application server identified by session manager 270 and starts the application, passing identification data to ensure that the launched application transmits user interaction and display requests to the correct instance of protocol engine. For each application the data store 273 can hold a list of application servers that are able to run the application that is being requested by a particular instance of a protocol engine. This list can be used by the launch process to determine which application server in the third tier is used to actually run the third tier application program. Session manager 270 can keep tract of the total number of applications running on each application server. At launch time, session manager 270 can select the application server for the list associated with the application that currently has the lowest number of applications running on it. This selection process can provide a load balancing mechanism for the application severs in the list so as to reasonably even the load among the application servers.

[0093] Display engine 278A issues a request to datastore engine 271 to find the application, in this case, the X Windows application 282A. This request is passed onto session manager engine 270 which checks to see if the requested application is running and needs to be resumed to the user. If an appropriate protocol engine is not already running on behalf of this user one is started by the session manager. Protocol engines are able to handle multiple applications that use the same protocols and so only one of each application type is required per user. An X Windows protocol engine can be used by multiple X Windows applications but not by a Windows application.

[0094] Session manager engine 270 starts the requested application on the network using a password stored in an encrypted cache (not shown) in data store 273 if it has already been supplied. If the password has not been supplied, session manager engine 270 prompts the user via display engine 278A for a password which is then stored in the encrypted cache. Session manager engine 270 then invokes the correct protocol engine for the requested application type, in this case protocol engine 276A. Protocol engine 276A establishes a new connection, as shown at path P3, to the requested application 282A that had been previously started by session manager engine 270. Session manager engine 270 stores the information about the protocol engine 276A used with application object 282A in datastore 273. As part of this sequence, if the application is one in which the application needs to connect to the protocol engine (which is the process used for X Windows applications) then information that is required by this mechanism is placed in the application's environment to allow it to connect to the appropriate protocol engine. Next because application object 282A is an X Windows application type, application 282A connects to protocol engine 276A. Application 282A is then in a suspended state. Information is passed back to the display engine 278A in order to enable it to connect back to protocol engine 276A. If the application is already running then it will be already connected to an active protocol engine and will be in a suspended state thus the startup steps to establish a connection to the application are not required.

[0095] Similar actions are performed by display engines 278B and 278C to request use of Windows application 282B and character-based application 282C, respectively. Instances of protocol engines 276B and 276C are established by session manager 270, and protocol engines 276B and 276C establish connections to applications 282B and 282C, respectively, along paths P4 and P5 respectively. For the character-based application types, the open connection to the application is passed to the protocol engine.

[0096] Display engines 278A-278C on client device 214 connect to ports 255A-255C on the UAP server and authenticate themselves. Display engines connect back using the information sent back from the appropriate protocol engine (this includes port number and temporary authentication information). This mechanism ensures that a separate connection is used for each display engine and avoids the need to multiplex data over a single connection. Status manager engine 274 receives these requests from the ports 255 via path P6 and passes it onto session manager engine 270. Session manager engine 270 then connects up the requesting display engine to the appropriate protocol engine. In this case display engines 278A, 278B, and 278C are connected by session manager engine 270 to protocol engines 276A, 276B and 276C, respectively via paths P7, P8 and P9, respectively, and ports 255A, 255B and 255C, respectively. Login port 251 remains open and is used for later launch requests and updates to the webtop.

[0097] The launch process described above is illustrated in the flow diagram presented in FIG. 7A and FIG. 7B. There the launch process 700 starts at step 702. The process proceeds to step 706 where status manager engine 274 is started. Next at step 710, all other engines are initialized. The process proceeds to step 714 where the application broker or UAP server is waiting for a request from a client. If no request is received the process proceeds to step 718 to wait for a client request and then back to step 714 to see if a client request has been received. If at step 714 a client request has been received, the process proceeds to step 722 where web server 264 retrieves bootstrap applet 221 from web pages store 268 and download it to client device 214. At step 726 the user presents login information such as user name and passwords using bootstrap applet 221. At step 730 the user information is checked and if it is not approved, the process proceeds to step 734 where the login is rejected. Here the process loops back to step 726 to receive user information. In the event of a rejected login various known mechanisms such as allowing multiple retries or sending the login information to the system administration and management engine 72 for use by the systems administrator.

[0098] If at step 730, the login information is correct, the process proceeds to step 738 where the session manager downloads to client device 214 a webtop that is built up using the bottom up traversal of the data store 273 containing icons representing the application programs available to the user. The system at step 742 waits to receive a request from a client for an application. If none is requested the process proceeds to step 746 to wait for a client application request and loops back to step 742. If an application request is received at step 742 the process proceeds to step 750 where a check of the data store for the user's password is performed. If no password is found the process proceeds to step 754 where a password request screen is downloaded to client device 214 asking the user to create a password. At step 758 it is determined if the user has submitted a password. If not, the process goes to step 762 where the session is ended. If at step 758 a password is given the process, at step 766, encrypts it and places it in data store 273 to be used for future logins. The process proceeds to step 770. At step 750 if the password has been found in the data store, the process proceeds to step 770.

[0099] At step 770, a determination is made if an existing session is in place for this user and the requested application. If it is, at step 774, the user is connected to the existing session. If not, a new session is started at step 782 and the session manager performs the load balancing previously described. Proceeding form either step 774 or 782 the session manager, at step 778, instantiates the appropriate protocol engine if one is not already running for the requested application type, instantiates display engine for the client device type, and downloads the display engine to the client device. Also here the instantiated protocol engine establishes a connection to the application server and the requested application. The user then interacts with the requested application. A determination is made at step 790 whether or not the application is resumable in the event that the connection to the client is ended. This information is either retrieved from data store 273 and can be determined from user input gotten when the application is started. Disconnection's can be voluntary by the user or accidental due to network problems. If the application is not to be resumable, the process goes to step 794 to disconnect the application upon the user existing. If the application is resumable, the process at step 798 will keep the connection to the application server and suspend the instance of the application that was running until the client device and user reconnect.

[0100] The application program that is instantiated on the application server residing on the third tier can be a program such as, for example, a drawing program, a spreadsheet program, a database program. The nature of the application program is not critical to the operation of the universal application server. Also the connection between the protocol engine and the third application server can be extended to other servers as is known in the art to order to access the desired application program. This routing information would be stored in the datastore.

[0101] The connection between the requesting display engine and the protocol engine forms an adaptive internet protocol link. The first phase in this link is to pass parameters identifying the characteristics of the client device and network connection to the protocol engine. These include the local performance factors and the supported display operations table, and the bandwidth of the connection. The adaptive internet protocol link then tunes itself for optimal performance for the given connection and client device. Finally, the display screens of the application are displayed on the client using display operations supported by the client device. The adaptive internet protocol link and, in particular, the protocol engine, monitors any changes in the network connection between the protocol engine and the display engine.

[0102] Adaptive Internet Protocol (AIP) Link Operation

[0103] The AIP link will be described in detail in relation to protocol engine 276A and display engine 278A. To deliver access to multiple types of client devices over a variety of network connections, the AIP link has to adapt to the characteristics of the client device and the network it is on. The AIP link does this by providing heuristic mechanisms that optimize the responsiveness of applications by monitoring, measuring and adapting the ways in which data is transferred between applications and the client devices including:

[0104] Round-trip measurement, latency and bandwidth

[0105] “Just full” transmission window management

[0106] Use of machine independent drawing capabilities (e.g., Java) for specific graphics functions

[0107] Color management

[0108] Data compression

[0109] Server-managed client caching

[0110] Queue management for graphics operations

[0111] Metering adjustment for “busy” networks

[0112] Suspendable/resumable sessions

[0113] The goal of the AIP link is to maximize use of the connection to the client device by trying to limit the number of transmitted requests while not overloading the connection and to optimize the requests to the fullest extent possible while not under utilizing the connection.

[0114]FIG. 3 shows the major process structure of the AIP link 300. The AIP link 300 comprises two major processes working cooperatively: Protocol Engine (PE) 276A and Display Engine (DE) 278A. The initial conditions are for PE 276A to be running on UAP server 250 waiting for DE 278A to contact it. The two processes are connected via a network connection using a standard network transmission protocol such as TCP/IP (path P7). Following this connection, the two exchange a series of requests to establish the characteristics of the client device, e.g. type of device, operating system, and the network connection, e.g. bandwidth and latentcy. DE 278A sends to PE 276A modified table 279 that describes the display operations or graphics primitives supported by client device 214 and the relative cost of executing each of these operations or primitives.

[0115] In the following description of the various processes the numbering of the steps is for convenience and to ease understanding of the processes. It will be apparent to those of skill in the art that the sequence of various steps may be changed without affecting the overall operation of the process.

[0116] As show in FIG. 4, in PE 276A, process 310, at step 1 waits for the Total Request Time (TRT) for the selected application to be less than a first pre-set limit and if it is it accepts from the selected application a received display request 312 formatted in a standard network display protocol, such as the X11 Windows protocol. The TRT represents the time costs for all of the requests currently found in PE 276A, specifically those in the Pending Request Queue (the first queue) and the Transmitted Request Queue (the second queue) described below.

[0117] At step 2, process 310 executes received application display request 312 and writes the resulting image to memory. At step 3, using modified table 279 of supported display operations previously sent from DE 278A, process 310 performs various transformations as is known in the art on request 312 converting it to a series of AIP requests which are simpler operations that are supported by client device 214. FIG. 5 presents a table listing some of the AIP requests that are available for use in the conversion process. This table is not meant to be an exclusive listing of all available AIP operations and other operations can be used as will be appreciated by those of skill in the art. Steps 2 and 3 can be performed in any order.

[0118] At step 4 costing is determined for the image and for each of the converted requests created in steps 2 and 3, respectively. Process 310 utilizes the performance factor, i.e., the PPC factor, received from DE 278A and determines the estimated time costs for sending and displaying the converted requests or the image at DE 278A. The request times for the converted requests are added to the TRT value. Sample translations of X11 Windows display requests are shown in Table 1 of FIG. 5 along with a brief description of the operation. Given in Table 2 of FIG. 5 in columns 2 and 3, are representative, empirically determined relative costs and estimated time costs (request times), respectively, for performing the operations in the converted request.

[0119] At step 5 the converted display requests are placed at the head of Pending Request Queue (PRQ) 320 and process 310 repeats again from step 1.

[0120] At step 6 process 330 waits for the Total Network Time (TNT) for the selected application to be less than a predetermined second value and for the total of the request times for the pending requests in PRQ 320 to exceed than a predetermined third value. If both conditions are met all pending requests in PRQ 320 are, at step 7, optimized and written back into PRQ 320 and the TRT value and the TNT are adjusted based on the results of the optimization. The TNT represents the request times for all of the requests currently found in TRQ 340.

[0121] The optimization process of step 7 consists of: step 7A, prune optimization of the converted requests with those in PRQ 320; step 7B merge optimization of the image with those requests in PRQ that effect the same screen area on DE 278A; step 7C, schedule optimization (attribute scheduling); and step 7D, update optimization (update scheduling). The optimization process is further discussed below in the subsection entitled Queue Optimization.

[0122] At step 8 the request at the tail of PRQ 320 is removed to be sent and a first sequence identifier, the send sequence number (SSN), is incremented and saved with the removed request to identify that request. At step 9 the removed request and its SSN are added to the head of Transmitted Request Queue (TRQ) 340 and the TNT is incremented by the request time of the newly added request (this also increments the TRT value). At step 10 the removed request is encoded into a form suitable for transmission over network connection P7 and sent to DE 278A. Preferably, to reduce the amount of data to be sent, the SSN identifier is not sent as part of the request. Requests are labeled or tagged with the SSN in the TRQ but the actual SSN identifier is not sent as part of the transmitted request. Corresponding identifiers are maintained by both the protocol engine and the display engine as each sends and receives requests. These identifiers are used as a reference point between the display engine and protocol engine. Again the order of steps 9 and 10 is not critical and the two operations can be performed in either order or simultaneously. The encoding process step 10 consisting of: step 10A, coordinate compression; step 10B, Run Length Encoding (RLE); step 10C., serialization, step 10D, delta compression; and step 10E, Zlib compression. Encoding is further discussed in the subsection Encoding and Performance Monitoring set forth below. At step 1 the encoded request is written to the connection and sent via path P7 to DE 278A and process 330 repeats from step 6.

[0123] In DE 278A, process 360 at step 12 is waiting for receipt of an encoded request. Upon receipt of an encoded request, at step 13 the request is unencoded consisting of one or more of the following depending on the compression techniques that were used in the request: step 13A, Zlib expansion; step 13B delta expansion; step 13C, RLE expansion; and step 13D, coordinate expansion. At step 14 the request is queued for execution and is displayed 372 on screen 370 of client device 214. At step 15 a second sequence identifier, the Return Sequence Number (RSN), is generated by adding one to the current RSN and this will match the SSN identifier associated with the just executed request. At step 16, if more than one second has past since the last time an RSN was sent or if there is no data now available from the network the current value of the RSN is sent to PE 276A for use by process 350. Process 360 then repeats beginning at step 12. As is known, the protocol engine and display engine rely on the transport mechanism of the network connection P7 to maintain the proper ordering or sequencing of the transmitted requests. This keeps the RSN identifier in synch with the SSN identifier and removes the need to send the SSN identifier with the transmitted request.

[0124] At PE 276A, process 350 at step 17 performs the RSN processing where the RSN identifier received from DE 278A via connection P7 is read and TRQ 340 is updated by removing each request from the tail of TRQ 340 until the SSN identifier for the request at the tail of TRQ 340 is greater than the RSN identifier and the TNT and TRT values are updated by subtracting the request time of each request as it is removed from TRQ 340. These changes may result in the new total times falling below the predetermined first, second and third values mentioned above, in which case, more requests may be read and transmitted. At step 18, process 350 performs periodic monitoring of the connection P7 and adjusts encoding process 330, as discussed below, in response to conditions (bandwidth available) found on the connection P7. Process 350 repeats starting at step 17.

[0125] Relative Cost and Request Times

[0126] The cost of executing a display request on the client device consists of the following items:

[0127] 1. Overhead of executing a single request irrespective of other factors.

[0128] 2. Time cost based upon the number of pixels touched by the request.

[0129] 3. An indication of the situations in which the request can be executed directly to the display hardware. If the request is not executable directly to the display then the display engine will simulate the request by drawing into memory and then copying this to the screen, thus incurring additional costs for the copying.

[0130] The costs for 1 and 2 are a relative factor that is to be scaled by an overall performance figure calculated for the client device to provide a request time (see Estimated Request Time column in Table 2 of FIG. 5). As explained previously, the display engine executes a series of graphic requests both to the screen and in memory to compute this overall factor. This factor is also transmitted to PE 276. Table 2 of FIG. 5 provides some samples of relative costs along with estimated request times for a specific client device.

[0131] Table 2 of FIG. 5 provides relative costs—basic and per pixel—of the various graphics operations. Table 2 does not provide costs for all of the AIP request display operations. In actual operation, costs for all AIP requests supported by DE 278 are provided in a table in PE 276. It contains a per pixel relative cost and a basic relative cost for each operation. The basic cost is empirically determined by testing execution of a given AIP request or display operation on a given class of client device in a given operating environment and is provided as part of the cost table that is found in each protocol engine. These basic costs can be thought of as being fixed. The performance factor—the per pixel cost, PPC—is determined as discussed previously and can be thought of as a dynamic or localized cost for the particular client device. The cost numbers are used by the cost calculation in the following way. The cost per pixel value is multiplied by an estimate of the number of pixels touched by the operation. The basic cost per display operation is multiplied by the number of basic operations that make up the request. For example, the operation AIP_POLYLINE is one where multiple line segments are being drawn so the basic relative cost for a 10 segment polyline operation would be 745 (10×74.50). Finally, the sum of these two values is multiplied by the performance factor (the PPC) that has been calculated for DE 276 on the client device to produce an approximation of the time taken by DE 276 to execute the request.

[0132] The actual numbers in Table 2 of FIG. 5 are calculated from the following two equations:

pixelCost=(m ₂ −m ₁)(L ₂ /b+L ₁ /b)/(n ₂ −n ₁)

itemCost=m ₁−(L ₁ /b)−n ₁*(sizeCost)

[0133] These form the solution to the equations

m ₁ =L ₁ /b+n ₁ *pixelCost+itemCost

m ₂ =L ₂ /b+n ₂ *pixelCost+itemCost

[0134] where

[0135] m₁ and m₂=single request time (s) for samples 1 and 2

[0136] L₁ and L₂=single request length (bytes) for samples 1 and 2

[0137] b=client device bandwidth (bytes/s)

[0138] n₁ and n₂=number of pixels for samples 1 and 2

[0139] The results are computed using two samples per request typically a 10 pixel test and a 500 pixel test. The results of the above calculations should then be multiplied by the current display rate of the test client device to produce the relative basic cost value shown in Table 2 of FIG. 5. The estimated request times given in Table 2 of FIG. 5 are calculated for a client device that reports a performance figure of 9.15 megapixels per second.

[0140] Bandwidth and Latency

[0141] PE 276A and DE 278A cooperate to establish the bandwidth of connection P7 and the latency. The latency is established as half of the average time that it takes to send a very small data packet from PE 276A to the DE 278A and back. The bandwidth is estimated by sending a series of large data packets and timing the difference between the arrival of the first packet and the last. The bandwidth is then defined as the total number of bytes transmitted divided by the total time difference. The bandwidth and latency are periodically measured. The size of the small request is about 3 bytes in length and the size of the large request is about 1024 bytes. The actual number of packets used is increased up to the point that more than 250 ms are needed to perform for the overall test. So the test is run starting using one packet, then if 250 ms have not been used, a series of 2 packets is then sent and again if 250 ms have not be used the test is repeated with a series of 3 packets. The number of packets is increased until about 250 ms are used for the test. The series is normally 5 packets but on lower bandwidth connections a smaller number is used to limit overall time taken.

[0142] This request time for a display operation which is added to the TRT value is based upon the following:

[0143] 1. The size of the request in bytes as it will be transmitted via the network connection.

[0144] 2. The time cost for executing one of these requests on the DE.

[0145] 3. The time cost for this request based upon the number pixels it will change.

[0146] 4. The time cost for copying the results to the actual display if this request can not be executed directly to the client display.

[0147] The size of the request is estimated by taking the size of the actual data points to be transmitted and multiplying these by the current compression ratio that is being achieved by the network encoding layer. This, in turn, is divided by the current network bandwidth to give an estimate of the total time required to transmit this request. The costs for 2, 3 and 4 are calculated by reference to table 279 obtained from DE 278 at startup. The total of these three values is then multiplied by the current overall performance factor of the DE to give an estimate of the time taken to execute the request by the DE. This is then combined with the estimated transmission time to give an overall request time for that request. The Total Request Time (TRT) is calculated for all queued requests (both those in the PRQ and those in the TRQ) for each application. New display requests from the application are not accepted by the protocol engine when the TRT exceeds the first preset value, typically 5 seconds. The PE 276 will not accept further display requests from the application when the request times of the requests in the PRQ and TRQ exceed this value so that the connection to the DE will not be overloaded.

[0148] The Total Network Time (TNT) is comprised of the request times of the requests in TRQ 340 plus the latency time associated with the network connection. The PE maintains a TNT required to send all of the requests currently in TRQ 340. The PE monitors the time associated with requests in the TRQ and will not transmit any further requests once this value reaches a pre-set value. This preset value is normally set at 2 seconds. This mechanism is used to ensure that a large backlog of requests does not build up for slowly executing client devices while ensuring that the full bandwidth of the network is used when this is the limiting factor.

[0149] Queue Optimization

[0150] Request optimization (FIG. 4, step 7) will take place if a reasonable number of requests are in the PRQ which is the case in normal operation. This process operates on an estimate of what will happen in the future in terms of request execution time not on what has happened in the past. This is important when dealing with requests for which the execution time varies greatly.

[0151] When there is space to send new requests to the DE a process of optimizing the PRQ is performed. Basically this portion of the PE process looks through the requests in the PRQ. It attempts to remove requests that are redundant, converts sequences of requests that operate on the same screen area to a single less expensive request, re-orders the queue to reduce overhead in the DE and adds hints to the queue to make the performance of the DE more efficient. Because this process can be expensive in terms of time, the optimization is only performed when the total execution time of the requests in the PRQ exceeds a preset threshold that is proportional to the predetermined first value (typically 5 seconds). The typical value used for the predetermined third value is {fraction (1/20)} of the first value. These figures are all arbitrary and are based upon an acceptable level of application latency. Advantageously, for slow clients or networks more optimization is performed (since the cost of requests is higher) and that for faster networks and clients the optimization is only performed when there is a large amount of output.

[0152] Preferably in step 7 of FIG. 4, the following four types of optimization are performed. These are pruning, merging, update scheduling (update optimization) and attribute scheduling (schedule optimization). The preferred method uses the following order of optimization—pruning, merging, following by, in either order, attribute scheduling and update scheduling. Pruning need not be done prior to merging but it is more efficient to do so. Update scheduling and attribute scheduling can be done in either order. Of the four types of optimization, merging is the most important in order to achieve good performance with the application and the connection.

[0153] 1. In pruning (FIG. 4, step 7A), converted requests that will be completely overwritten by a request later in the queue are removed. This optimization is equivalent to executing the series of graphics requests very quickly such that the effects of the earlier requests are not visible. Preferably, this is done prior to merging.

[0154] 2. In merging (FIG. 4, step 7B) if the cost of a group of converted requests that update a particular screen area is greater than the cost of transmitting an image of that portion of the screen then all of the requests are removed from the PRQ and an image request with its associated request time is inserted. The TRT is adjusted to reflect these removals and additions.

[0155] 3. For update scheduling (FIG. 4, step 7D), requests that can not be executed directly to the screen are grouped together. Hints are inserted into the request stream so that the DE can execute all of the requests in off-screen memory and then copy the results on screen in a single operation rather than requiring one copy operation per request.

[0156] 4. For attribute scheduling (FIG. 4, step 7C), requests which require the same color, and drawing modes are grouped together to avoid the need for the DE to switch back and forth for each request. This operation is equivalent to re-ordering the PRQ to make requests that share attributes adjacent within the PRQ. When performing this process it is necessary to ensure that the execution of overlapping requests is not changed.

[0157] Encoding and Performance Monitoring

[0158] The encoding process transforms a graphics request into a format suitable for transmission via the network connection to the DE. The DE inverts this process when the request is read from the network connection. The packet format used on the network connection takes the form of a header which has a byte indicating the type of the request, a two byte field which indicates the length of the packet and then a series of bytes which represent the actual request. The data for a particular request varies, but is, typically, either a series of coordinates for requests that involve some form of line drawing or a series of bytes for text and image requests. The encoding process is designed to enable the number of bytes required to represent the request to be minimized thus reducing the time required to transmit the data on a slow network connection. However, the processing time required to actually encode the data can be large. Thus, on higher bandwidth connections the AIP reduces the amount of encoding applied. This reduces the overhead but increases the number of bytes transmitted.

[0159] The process of encoding uses the following steps

[0160] 1. For coordinate compression, if the request contains a series of coordinates, all of these coordinates are converted to be relative to the first set in the request (FIG. 4, step 10A).

[0161] 2. If the request contains either text or an image it is compressed, preferably using the well know technique of Run Length Encoding (RLE) (FIG. 4, step 10B).

[0162] 3. The request is then serialized, i.e., converted into a simple series of bytes with a fixed byte ordering (FIG. 4, step 10C). During this serialization process any small integer values in the range −64 to +128 are encoded into a single byte.

[0163] 4. Requests that when encoded are less than 32 bytes in length are compared against a cache of previous requests. If the number of differences between the current request and a previous request is less than 8 bytes then the request is re-encoded as a reference to the previous request plus a series of two byte pairs describing the offset of the byte and the replacement value. This compression technique is known as delta compression (FIG. 4, step 10D). If the encoded request is less than 32 bytes in length, it is entered into a delta compression cache (not shown) and the oldest item in the cache is discarded. Typically, the cache contains the last 32 requests although a lower or higher number of items can be chosen.

[0164] 5. The encoded form of the request is compressed preferably using the well know Z-Lib compression algorithm (FIG. 4, step 10E).

[0165] 6. The encoded form of the request is sent over the connection to the DE (FIG. 4, step 11).

[0166] At step 18 of FIG. 4, the AIP changes the encoding level based upon the bandwidth connection parameter of the connection as follows:

[0167] 1. If the bandwidth is >300 Kbytes per second steps 3 and 4 are omitted.

[0168] 2. If the bandwidth is <300 Kbytes per second steps 3 and 4 are applied.

[0169] 3. If the bandwidth is >300 Kbytes per second the Z-Lib compressor is disabled.

[0170] 4. If the bandwidth is between 100K and 300 Kbytes per second the Z-Lib compressor is set to use compression level 1 (the lowest and quickest to achieve compression level).

[0171] 5. If the bandwidth is between 3 Kbytes and 100 Kbytes per second the Z-Lib compression level is set to level 5 (a mid range compression level).

[0172] 6. If the bandwidth is less than 3 Kbytes per second the Z-Lib compression level is set to 9 (the highest compression level).

[0173] Because the performance of the overall system can change over time AIP allows for both the available bandwidth of the network connection and the display speed of the DE to change. The PE uses two processes to track such changes. In the first performance updating process, the PE periodically re-checks the network bandwidth and latency. Typically, this is done about every five minutes. The PE also sends a request to the DE asking it to update the overall performance factor and send this new value back to the PE. These updated values are used in calculating the request times for newly added requests to PRQ 320. Alternatively, if desired, the request times of requests already in PRQ 320 and TRQ 340 get updated. The details in how these values are obtained were discussed above in the description of the UAP system startup.

[0174] In the second process, the PE when it moves a request from PRQ 320 to TRQ 340 adds to the request an estimate of the time the request should be removed from TRQ 340. When the PE removes the request from TRQ 340 it maintains a running average and variance for the percentage error associated with this estimate. If the total of the average error minus half of the variance exceeds a pre-set limit (typically 200%) and the time since the last reevaluation is more than 1 minute then the performance updating process is invoked immediately.

[0175] The overall effect of these processes is to provide a flow control mechanism that controls the rate that requests are read from the application and at which they are transmitted over the network to the client device. The goal of the AIP system is to ensure that DE 278 never stalls due to lack of available requests, that a large backlog of requests is not allowed to build up and that a reasonable number of requests are made visible to the UAP system within PRQ 320 since it is these requests that are available for optimization by the PE. It will be appreciated that for slower connections, requests will remain in the PRQ for a longer period of time so as to not slow down or overload the connection but advantageously giving the PE greater opportunity for optimization of the requests in the PRQ and conversely, when a more robust connection is available more requests can be sent utilizing the bandwidth of the connection while reducing the time spent in the PRQ increasing performance at the client device thus making the best possible use of the capabilities of the client device and the network connection for maintaining and enhancing performance.

[0176] The implementation languages that are used are such that the protocol engines are typically created as a native binary for performance reasons. However, they could also be implemented in the Java programming language. The display engines are implemented in several languages to provide a broad coverage of client devices. The Java programming language is used to give support for platforms supporting either Java runtimes or Java supported in a web browser. However for systems that do not support a suitable Java environment native binary versions of the display engine components are used. Further, not all engines need to be in operation at all times. For example, if no client devices are requesting any application services, no protocol engines or display engines will be operating.

Color Quality Feature

[0177] The invention can include a color quality feature to reduce the required bandwidth required for sending high quality images (eg. 24 bits per pixel) to the client device. The invention can include a variety of color quality mechanisms. If the user is prepared to accept a reduction in picture quality, with the reward of less bandwidth utilization and consequential improved performance, then the color quality feature can be enabled. The color quality feature and mechanisms will be described in detail after a short description of the context of the invention which will make the importance of the color quality feature more clear.

[0178] The amount of bandwidth required for a given image depends upon how much data is transferred for that image. The amount of data required for a given image depends upon how well the image can be compressed before transmission. The basic aim of the color quality feature is to reduce the number of possible colors in the image. Reducing the number of colors in the image will reduce the number of potential values passed into the image compressor. It is an important advantage of the color quality feature that having fewer possible pixel values within an image improves the likelihood of there being runs of the same colors, repeated patterns etc., which are amenable to compression and hence will help to give a much improved compression ratio.

[0179] The invention can incorporate one, two or more types of image compression mechanisms. These types include the well known and readily commercially available mechanisms known as Run Length Encoding (RLE) and HexTile. RLE compression is a simple technique aimed at compressing runs of the same color on each scan line. HexTile is a more sophisticated compressor, as it analyses the image data in (e.g., 16×16 pixel squares) and is able to compress the data in a variety of different ways and can then choose the best method for the data concerned. Of course, the invention is not limited to utilizing these two mechanisms.

[0180] The level of color reduction used can be determined by user configurable settings and/or measured bandwidth. Combinations of settings and parameters determined by measurement are possible. Three preferred options are described below.

[0181] A first option is that a fixed level of color quality can be (pre)determined. The fixed level can be predetermined without regard to an application or determined by the application. This option includes the ability to use full quality (i.e., no reduction in quality), which involves not utilizing the color quality feature, albeit available for implementation at a subsequent time.

[0182] A second option is that the quality can be determined dynamically based upon the available bandwidth to the client device. This option permits (near) real time optimization. Table D shows various bandwidths and an example of associated color quality.

[0183] A third option is that the color quality can be determined once the session is started based upon the available bandwidth when the session (e.g., application) begins. This avoids problems with changing bandwidth resulting in different quality settings being used for different parts of the same image, which can result in unpleasant visual effects.

[0184] An exemplary sequence of steps to implement the color quality feature is depicted in FIG. 8. Of course, the invention can utilize other sequences of steps.

[0185] Referring to FIG. 8, at step 810 image data arrives at the X protocol engine in full color format (eg. 24 bits per pixel color, with the possibility of 16 million different colors in use). Of course, the invention can accommodate all color encoding formats.

[0186] Still referring to FIG. 8, at step 820 a decision is made regarding which level of quality to apply to the data. A first choice is none (the feature is disabled, or not needed because full bandwidth is available). A second choice is a fixed level pre-set by the user. A third choice is a level selected automatically at application start-up, based on the available bandwidth. A fourth choice is a level selected automatically at the current time, based upon the available bandwidth. Of course, the invention is not limited to those choices, combinations, and sequential switching, being possible, especially with regard to discrete fields.

[0187] Still referring to FIG. 8, at step 830 the data is transformed by converting the image pixels appropriate to the chosen quality level, by applying a pixel mask to reduce the number of significant color bits (eg. 0xf0f0f0 for 12 bit quality). The data is then further transformed by applying another pixel mask to find (calculate) a way point for each of the resulting reduced number of colors as a function of the applied quality level. The way point is preferably a mid-way point, so that dark colors and light colors are affected equally (eg. 0x080808 for 12 bit quality). Of course, the invention is not limited to use with a particular incoming quality level or to the mid-way point equalization, color bias being possible.

[0188] Still referring to FIG. 8, at step 840 a decision is made regarding which level of image compression to apply to the data. A first choice is none (image compression is disabled). A second choice is RLE (image interlacing is required and HexTile is unsuitable). A third choice is Basic HexTile. A fourth choice is Advanced HexTile (to handle a larger number of colors). Of course, the invention is not limited to these choices.

[0189] Still referring to FIG. 8, at step 850 a decision is made regarding whether to apply a general packet compressor to the data stream. A first choice is none (the feature is disabled). A second choice is Zlib (fixed level chosen at application start-up). A third choice is Zlib (variable level, adjusted dynamically depending upon the current bandwidth). Of course, the invention is not limited to these choices.

[0190] Still referring to FIG. 8, at step 860, the resultant data is put in the output buffer and sent to the X display engine 870. The X display engine 870 then decompresses the data stream, and then decompresses the image, and then renders the image on the client.

[0191] The color quality feature can take the form of a method, comprising a color quality data transformation including: selecting a quality level to apply to a set of image data having a number of significant color bits defining an initial number of possible colors; applying a pixel mask to the set of image data, the initial number of possible colors reduced to a smaller number of possible colors as a function of the quality level; loading the set of image data into an output buffer; and sending the set of image data from the output buffer to a display engine. Of course, the invention is not limited to this implementation.

[0192] Referring to Table A and Table B, exemplary pixel masks are described for 24 and 16 bit encoding. The tables show pixels masks that can be chosen for the each quality level. TABLE A Images with 24 bits per pixel: Quality Level (bits per pixel) And Mask Or Mask 24 0xffffff 0x000000 21 0xfefefe 0x000000 18 0xfcfcfc 0x020202 16 0xf8fcf8 0x040204 15 0xf8f8f8 0x040404 12 0xf0f0f0 0x080808 9 0xe0e0e0 0x101010 6 0xc0c0c0 0x202020

[0193] TABLE B Images with 16 bits per pixel: Quality Level (bits per pixel) And Mask Or Mask 16 0xffff 0x0000 15 0xffdf 0x0000 12 0xf79e 0x0000 9 0xe71c 0x1082 6 0xc618 0x2104

[0194] Table C shows the affects of each quality level on the red, green and blue elements of each pixel. TABLE C Images with 24 bits per pixel: Quality Level (bits per pixel) Pixel values (8 bits of red, green, blue) 24 (256³ = 16 million colors) 256 values (0, 1, 2, 3, . . . , 255) 21 (128³ = 2 million colors) 128 values (1, 3, 5, . . . , 255) 18 (64³ = 256K colors) 64 values (2, 6, 10, . . . , 254) 15 (32³ = 32K colors) 32 values (4, 12, 20, . . . , 252) 12 (16³ = 4096 colors) 16 values (8, 24, 40, . . . , 248) 9 (8³ = 512 colors) 8 values (16, 48, 80, . . . , 240) 6 (4³ = 64 colors) 4 values (32, 96, 160, 224)

[0195] Table D shows which level of quality is chosen automatically for particular levels of bandwidth. TABLE D Quality Level (bits per pixel) Bandwidth (KB per second) 24 Above 200  21 100 to 200  18 64 to 100 15 8 to 64 12 Below 8  

[0196] The color quality feature can be combined with the packet shaping feature described below. Similarly, the color quality feature can be combined with one or more other aspects of the invention described in this patent document.

Packet Shaping Feature

[0197] This invention can include a packet shaping feature to shape packets and reduce overhead. The invention can include a variety of packet shaping mechanisms. The packet shaping feature and mechanisms will be described in detail after a short description of the context of the invention that will make the importance of the packet shaping feature more clear.

[0198] AIP (Adaptive Internet Protocol) packet shaping is a mechanism intended to maximize the amount of application data contained within a low level communication layer data packet (such as but not restricted to a TCP/IP packet), while still providing fast interactive performance when operating on networks that may have a high latency (which may be indicated by a large round trip time). The packet shaping feature invention is important because in many network implementations the headers required by the network layer can be large. This means that if a fixed amount of application data can be transmitted using either (i) a large number of small packets or (ii) a smaller number of large packets, the total amount of data transmitted over the network will be much greater for (i) the small packets than (ii) the large packets. Typical packet header sizes are of the order of 50 bytes for a protocol such as TCP/IP.

[0199] This problem has been recognized for some time and various techniques have been used to reduce the impact of packet overhead on interactive applications (which tend to generate a large number of small packets). A well known mechanism used in many TCP/IP implementations, is known as the “Nagle algorithm.” This algorithm is described fully in RFC 896 “Congestion Control in IP/TCP Internetworks” (currently available at: http://www.ietf.org/rfc/rfc896.txt).

[0200] The packet shaping feature and mechanisms use the additional information collected by AIP on the round trip time of the network and the performance of the display engine to provide a very effective implementation. The packet shaping feature and mechanism prevents the well-known problem of the introduction of a round trip time delay when two small packets are sent one after another.

[0201] The packet shaping feature is depicted in a context in FIG. 9. The packet shaping feature can be conceptionalized as a control stage 910 governing when to either i) remove requests from the PRQ (pending request queue) and apply the packet shaping mechanisms to those requests or bypass the packet shaping. Of course, the packet shaping feature can be implemented in other contexts.

[0202] As previously described with regard to FIG. 4, the protocol engine maintains a total request time (TRT) for all requests in both queues (i.e., PRQ and TRQ) and also maintains a total network time (TNT) for all requests in the second queue (the transmitted request queue, aka TRQ). A preferred logic for determining whether to perform the packet shaping features follows. If the TNT (Total Network Time) is less than the current round trip time (which is twice the current latency) then continue on to step 8. If the TRT (total request time) minus the TNT (total network time) is greater than half the first pre set limit described in step 1 then continue on to step 8. (By definition, the TRT minus the TNT is equal to the total time of the requests in the pending request queue (PRQ).) Otherwise do not continue on to step 8 at this time and shape packets at control stage 910.

[0203] FIGS. 10A-10C show three exemplary embodiments of shaped packets. FIG. 10A depicts a generic-shaped packet, including a header 1010, a first data portion 1020, and a second data portion 1030. FIG. 10B shows a specific implementation of a shaped packet wherein the header 1010 includes a subsection 1040 identifying the location of the end of the first data portion 1020 and/or the beginning of the second data portion 1030. FIG. 10C shows another specific implementation of the packet shaping feature wherein a marker 1050 demarcates a boundary between the first data portion 1020 and the second data portion 1030.

[0204] While FIGS. 10B and 10C show mechanisms that can preserve a packet boundary by adding headers or markers. FIG. 10 shows that the data can be considered a simple data stream of bytes with no requirement to preserve any sort of packet boundary. Consider a situation in which over a period of time the server would have sent data as the following set of TCP packets: 200 bytes; 200 bytes; 20 bytes; 200 bytes. The packet boundaries are entirely arbitrary and are simple a consequence of timing. In the above each packet would have a 50 byte header. When the conditions are correct, the packet shaping feature would enable the above to be simply sent as a single TCP packet of 620 bytes plus a single 50 byte TCP header. No additional bytes need to be added to the data to indicate packet boundaries. The headers can be purely a function of using the underlying network transport and in the case of TCP (which is a stream protocol) are not visible to the application layer program. The TCP case is probably the most common usage of this solution.

[0205] Shaped packets can be accumulated in a buffer within control stage 910 (or at an alternative location). The shaped packets can be routed to step 8 when the buffer approaches (or reaches) full capacity. The contents of the shaped packet buffer can also be routed to step 8 when the criterion for shaping are no longer met and/or after the passage of a period of time.

[0206] The effect of this additional packet shaping step is that when there is very little activity between the Protocol Engine and the Display Engine, data will be processed by the system immediately. This typically means that smaller packets will be used but that there will be no impact on the response of the system. If the total amount of time required by the client to receive and process the outstanding requests rises above the current round trip time, then further requests will only be processed when there are a significant (e.g., large) number of them pending in the control stage 910, which can be termed an adjunct to the PRQ. Typically this will mean that larger numbers of requests will be collected together and thus larger packets will be used to transmit the data. By using the AIP model of the processing of requests, the packet shaping feature can ensure that the display engine will not have to wait for a request if one is available (since at this point the TRT (total request time) will have fallen below the round trip time and it will only take half the round trip time for the new requests to reach the client). Requests can also be batched to improve the overall efficiency of the network transmission.

[0207] The packet shaping feature can be implemented as a method, comprising a packet shaping data structure transformation including: if i) a total network time, defined by a total time of requests in a pending request queue, is equal to or greater than a current round trip time, defined by twice a current latency, and ii) a total request time, defined by a sum of a total time of requests in the pending request queue and a total time of requests in a transmitted request queue, minus the total network time is equal to or less than half a preset limit, then forming a shaped packet by associating a first data portion with a second data portion and a header. Of course, the invention is not limited to this implementation.

[0208] The packet shaping feature can be combined with the color quality feature described above. Similarly, the packet shaping feature can be combined with one or more other aspects of the invention described in this patent document.

[0209] Other embodiments of the invention will be apparent to those skilled in the art from a consideration of the specification or from practice of the invention disclosed herein. It is intended that the specification be considered as exemplary only with the scope and spirit of the present invention being indicated by the following claims. 

What is claimed is:
 1. A method, comprising a color quality data transformation including: selecting a quality level to apply to a set of image data having a number of significant color bits defining an initial number of possible colors; applying a pixel mask to the set of image data, the initial number of possible colors reduced to a smaller number of possible colors as a function of the quality level; loading the set of image data into an output buffer; and sending the set of image data from the output buffer to a display engine.
 2. The method of claim 1, further comprising applying another pixel mask to the set of image data, the another pixel mask calculating a way point for each of the reduced number of possible colors as a function of the quality level and the initial number of possible colors.
 3. The method of claim 2, wherein the way point is a mid-way point.
 4. The method of claim 2, wherein the way point is not a mid-way point.
 5. The method of claim 1, further comprising applying a level of image compression to the set of image data.
 6. The method of claim 5, wherein the level of image compression is defined by the use of at least one technique selected from the group consisting of RLE, Basic HexTile and Advanced HexTile.
 7. The method of claim 1, further comprising applying a general packet compressor to the set of image data.
 8. The method of claim 7, wherein the general packet compressor includes at least one member selected from the group consisting of fixed level Zlib and variable level Zlib.
 9. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 1. 10. An electronic media, comprising a program for performing the method of claim
 1. 11. An apparatus for performing the method of claim
 1. 12. In a client server network providing at least one application service for selection by a user via a client device, a method for transmitting to and displaying on the display device of the client device display requests of the requested application service which are not supported by the client device, comprising: downloading from the server and executing on the client device a display engine; initializing a protocol engine with parameters of the client device comprising display operations supported by the client device, the relative cost of each supported operation and a local performance factor and parameters of the connection from the server to the display engine comprising bandwidth and latency; executing on the server the protocol engine comprising the steps of: maintaining a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device; each request having a corresponding relative cost and request time determined by the relative cost and the local performance factor; maintaining a total request time for all requests in both queues and maintaining a total network time for all requests in the second queue; while the total request time is less than a predetermined first value: accepting a new pending request from the application service; executing the new pending display request to create an image to be displayed on the client device, saving the resulting image to memory and determining for the image its relative cost and its corresponding request time based the local performance factor; converting the new pending display request from the application service into a sequence of converted requests that are supported by the client device, placing the sequence of converted requests in the first queue, determining for each converted display request in the sequence its relative cost and its corresponding request time based on the local performance factor, and incrementing the total request time by the request time of each added request; while the total network time is less than a predetermined second value: optimizing the first queue using a merge optimization when the request times of the pending requests in the first queue exceed a predetermined third value and updating the total request time based on the results of the merge optimization; reading a pending request from the first queue and labeling each read request with a first sequence identifier; encoding each read display request for transmission to the display engine; placing a copy of the optimized request into the second queue, incrementing the total network time by the request time for the newly added request, and transmitting the encoded display request to the display engine; executing the display engine comprising the steps of: unencoding the received converted display request and displaying it on the client device; generating a second sequence identifier corresponding to first sequence identifier of the displayed request; and periodically transmitting to the protocol engine the second sequence identifier of the last received display request displayed on the client device; and upon receipt of the second sequence identifier, the protocol engine further comprising the steps of: deleting from the second queue the display request whose first sequence identifier is the same as the second sequence identifier and all pending displayed requests in the second queue having first sequence identifiers that are prior to such second sequence identifier; and decrementing from the total request time and from the total network time the request time values of each of the deleted display requests, wherein transmitting the encoded display request to the display engine includes a color quality data transformation including: selecting a quality level to apply to a set of image data having a number of significant color bits defining an initial number of possible colors; applying a pixel mask to the set of image data, the initial number of possible colors reduced to a smaller number of possible colors as a function of the quality level; loading the set of image data into an output buffer; and sending the set of image data from the output buffer to the display engine.
 13. The method of claim 12, further comprising applying another pixel mask to the set of image data, the another pixel mask calculating a way point for each of the reduced number of possible colors as a function of the quality level and the initial number of possible colors.
 14. The method of claim 13, wherein the way point is a mid-way point.
 15. The method of claim 13, wherein the way point is not a mid-way point.
 16. The method of claim 12, further comprising applying a level of image compression to the set of image data.
 17. The method of claim 16, wherein the level of image compression is defined by the use of at least one technique selected from the group consisting of RLE, Basic HexTile and Advanced HexTile.
 18. The method of claim 12, further comprising applying a general packet compressor to the set of image data.
 19. The method of claim 18, wherein the general packet compressor includes at least one member selected from the group consisting of fixed level Zlib and variable level Zlib.
 20. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 12. 21. An electronic media, comprising a program for performing the method of claim
 12. 22. An apparatus for performing the method of claim
 12. 23. The method of claim 12 wherein the relative cost for a request comprises a predetermined fixed basic operation cost and a localized cost per pixel calculated for the client device.
 24. The method of claim 12 wherein the optimization of the first queue further comprises the step of performing a pruning optimization prior to performing the merge optimization.
 25. The method of claim 24 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 26. The method of claim 12 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 27. The method of claim 12 wherein the encoding further comprises the steps of performing coordinate compression; performing run length encoding compression; serializing the coordinate compressed and run length encoded compressed request into fixed byte ordered strings; performing delta compression; and performing Zlib compression.
 28. The method of claim 27 wherein the encoding further comprises the steps of: omitting the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine greater than about 300 Kbytes per second; applying the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine is less than about 300 Kbytes per second; omitting Zlib compression if the bandwidth of the connection to the display engine is greater than about 300 Kbytes per second; setting the ZLib compression to its lowest and quickest compression level if the bandwidth of the connection to the display engine is between about 1100 Kbytes to about 300 Kbytes per second; setting the ZLib compression to a midrange compression level between its highest and lowest compression levels if the bandwidth of the connection to the display engine is between about 3 Kbytes to about 100 Kbytes per second; and setting the ZLib compression to its highest compression level if the bandwidth of the connection to the display engine is less than about 3 Kbytes per second.
 29. The method of claim 12 further comprising: periodically updating the of bandwidth and latency parameters; and using the updated parameters to determine the level of encoding used.
 30. The method of claim 12 further comprising: periodically updating the bandwidth and latency parameters; and using the updated parameters to determine the level of encoding used.
 31. The method of claim 12 further comprising: periodically updating the client device local performance factor and using the updated performance factor to determine the request times of pending requests received after the updating has occurred; on moving a pending request from the first queue to the second queue adding to the request an time estimate of the time when that request should be removed from the second queue based on the updated local performance factor; on removing the request from the second queue, maintaining a running average and variance for the percentage error for the estimated time as compared to the actual time that the request was removed, and, if the total of the average error minus half of the variance exceeds a pre-set limit and the time since the last update is more then one minute then immediately repeating the steps of updating the connection parameters and the client device local performance factor parameter.
 32. The method of claim 12 wherein the updated local performance is used to update the request times of the requests in the first and second queues.
 33. The method of claim 12 wherein the predetermined first value is about five seconds, the predetermined second value is about two seconds, and the predetermined third value is about {fraction (1/20)} of the predetermined first value.
 34. In a client server network providing at least one application service for selection by a user via a client device having a display engine operating thereon, a method for converting, transmitting, and displaying requests of the requested application service that are not supported by the client device, comprising: downloading from the server and executing on the client device a display engine associated with the application service requested by the user; loading on a server in the network a protocol engine in communication with the display engine and the requested application service; using the display engine to determine parameters of the client device comprising display operations supported by the client device, the relative cost of each supported operation and a local performance factor and parameters of the connection from the server to the display engine comprising bandwidth and latency; transmitting to and initializing the protocol engine with the client device parameters and the connection parameters; executing the protocol engine comprising the steps of: maintaining a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device; each request having a corresponding relative cost and request time determined by the relative cost and the local performance factor; maintaining a total request time for all requests in both queues and maintaining a total network time for all requests in the second queue; while the total request time is less than a predetermined first value: accepting from the application service a new pending display request to be displayed on the client device; executing the new pending display request to create an image to be displayed on a portion of a display screen of a client device, saving the resulting image to memory, and determining for the image its relative cost and its corresponding request time based the local performance factor; converting, based on the support display operations of the client device, the new pending display request into a sequence of converted requests that are supported by the client device, placing the sequence of converted requests in the first queue, determining for each converted display request its relative cost and its corresponding request time based on the local performance factor, and incrementing the total request time by the request time of each converted request added to the first queue; while the total network time is less than a predetermined second value: optimizing the first queue using a merge optimization when the request times of the pending requests in the first queue exceed a predetermined third value and updating the total request time based on the results of the merge optimization; reading a pending request from the first queue and labeling each read request with a first sequence identifier; encoding each read display request for transmission to the display engine; placing a copy of the optimized request into the second queue and incrementing the total network time value for the newly added request; and transmitting the encoded display request to the display engine; executing the display engine comprising the steps of: unencoding the received converted display request and displaying it on the client device; generating a second sequence identifier corresponding to first sequence identifier of the displayed request; and periodically transmitting to the protocol engine the second sequence identifier of the last received display request displayed on the client device; and upon receipt of the second sequence identifier of the last displayed display request, the protocol engine further comprising the steps of: deleting from the second queue the display request whose first sequence identifier is the same as the second sequence identifier and all pending displayed requests in the second queue having identifiers that are prior to such second sequence unique identifier; and decrementing from the total request time and from the total network time the request time values of each of the deleted display requests, wherein transmitting the encoded display request to the display engine includes a color quality data transformation including: selecting a quality level to apply to a set of image data having a number of significant color bits defining an initial number of possible colors; applying a pixel mask to the set of image data, the initial number of possible colors reduced to a smaller number of possible colors as a function of the quality level; loading the set of image data into an output buffer; and sending the set of image data from the output buffer to the display engine.
 35. The method of claim 34, further comprising applying another pixel mask to the set of image data, the another pixel mask calculating a way point for each of the reduced number of possible colors as a function of the quality level and the initial number of possible colors.
 36. The method of claim 35, wherein the way point is a mid-way point.
 37. The method of claim 35, wherein the way point is not a mid-way point.
 38. The method of claim 34, further comprising applying a level of image compression to the set of image data.
 39. The method of claim 38, wherein the level of image compression is defined by the use of at least one technique selected from the group consisting of RLE, Basic HexTile and Advanced HexTile.
 40. The method of claim 34, further comprising applying a general packet compressor to the set of image data.
 41. The method of claim 40, wherein the general packet compressor includes at least one member selected from the group consisting of fixed level Zlib and variable level Zlib.
 42. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 34. 43. An electronic media, comprising a program for performing the method of claim
 34. 44. An apparatus for performing the method of claim
 34. 45. The method of claim 34 wherein the relative cost comprises a predetermined fixed basic operation cost and a localized cost per pixel calculated for the client device.
 46. The method of claim 34 wherein the optimization of the first queue further comprises the step of performing a pruning optimization prior to performing the merge optimization.
 47. The method of claim 46 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 48. The method of claim 34 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 49. The method of claim 34 wherein the encoding further comprises the steps of: performing coordinate compression; performing run length encoding compression; serializing the coordinate compressed and run length encode compressed request into fixed byte ordered strings; performing delta compression; and performing Zlib compression.
 50. The method of claim 49 wherein the encoding further comprises the steps of: omitting the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine greater than about 300 Kbytes per second; applying the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine is less than about 300 Kbytes per second; omitting Zlib compression if the bandwidth of the connection to the display engine is greater than about 300 Kbytes per second; setting the ZLib compression to its lowest and quickest compression level if the bandwidth of the connection to the display engine is between about 100 Kbytes to about 300 Kbytes per second; setting the ZLib compression to a midrange compression level between its highest and lowest compression levels if the bandwidth of the connection to the display engine is between about 3 Kbytes to about 100 Kbytes per second; and setting the ZLib compression to its highest compression level if the bandwidth of the connection to the display engine is less than about 3 Kbytes per second.
 51. The method of claim 50 further comprising: periodically updating the bandwidth and latency parameters; and using the updated connection parameters to determine the level of encoding used.
 52. The method of claim 34 further comprising: periodically updating the bandwidth and latency parameters; and using the updated parameters to determine the level of encoding used.
 53. The method of claim 50 further comprising: periodically updating the client device local performance factor parameter and using the updated performance factor to update the request times of pending requests received after the updating has occurred; on moving a pending request from the first queue to the second queue adding to the request an time estimate of the time when that request should be removed from the second queue based on the updated local performance factor; on removing the request from the second queue, maintaining a running average and variance for the percentage error for the estimated time as compared to the actual time that the request was removed, and, if the total of the average error minus half of the variance exceeds a pre-set limit and the time since the last update is more then 1 minute then immediately repeating the steps of updating the connection parameters and the client device local performance factor parameter.
 54. The method of claim 50 wherein the updated local performance is used to update the request times of the requests in the first and second queues.
 55. The method of claim 34 wherein the predetermined first value is about five seconds, the predetermined second value is about two seconds, and the predetermined third value is about {fraction (1/20)} of the predetermined first value.
 56. In a client server network providing at least one application service for selection by a user via a client device, a method for transmitting to and displaying on the display device of the client device display requests of the requested application service which are not supported by the client device, comprising: downloading from the server and executing on the client device a display engine associated with the application service requested by the user; loading on a server in the network a protocol engine in communication with the display engine and the requested application service; providing to the display a table of display operations expected to be supported by the client device on which the display engine is executing; using the display engine to determine parameters of the client device comprising: testing the operation of each of the expected display operations on the client device and modifying the table to indicate which of the expected display operations was successfully tested; determining a local performance factor for the client device; and determining parameters of the connection from the server to the display engine comprising bandwidth and latency; transmitting to and initializing the protocol engine with the client device parameters and the connection parameters as determined by the display engine; executing the protocol engine comprising the steps of: maintaining a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device; each request having a corresponding relative cost and request time determined by the relative cost and the local performance factor; maintaining a total request time for all requests in both queues and maintaining a total network time for all requests in the second queue; while the total request time is less than a predetermined first value: accepting from the application service a new pending display request to be displayed on the client device; executing the new pending display request to create an image to be displayed on a portion of a display screen of a client device, saving the resulting image to memory, and determining for the image its relative cost and its corresponding request time based the local performance factor; converting, based on the support display operations of the client device, the new pending display request into a sequence of converted requests that are supported by the client device, placing the sequence of converted requests in the first queue, determining for each converted display request its relative cost and its corresponding request time based on the local performance factor, and incrementing the total request time by the request time of each converted request added to the first queue; while the total network time is less than a predetermined second value: optimizing the first queue when the request times of the pending requests in the first queue exceed a predetermined third value by comparing the relative cost of the image to the sum of the relative costs of pending converted display requests in the first queue intended for display on the same portion of the display device of the client device as the image, and, if the relative cost of the image is less than the sum of the relative costs of the compared pending display requests: converting the image into a converted image request and determining its relative cost and its request time based on the local performance factor; replacing in the first queue the compared pending converted display requests with the converted image display request; and adjusting the total request time to reflect the addition of the converted image request and removal of the compared pending requests in the first queue; reading a pending request from the first queue and labeling each read request with a first sequence identifier; encoding each read display request for transmission to the display engine based on the bandwidth of the connection; placing a copy of the optimized request into the second queue and incrementing the total network time value for the newly added request; and transmitting the encoded display request to the display engine; using the display engine to process the received encoded display requests comprising the steps of: unencoding the converted display request and displaying it on the client device; generating a second sequence identifier corresponding to first sequence identifier of the displayed request; and periodically transmitting to the protocol engine the second sequence identifier of the last display request displayed on the client device; and upon receipt of the second sequence identifier of the last displayed display request, the protocol engine further comprising the steps of: deleting from the second queue the display request whose first sequence identifier is equal to the second sequence identifier and all pending displayed requests in the second queue having first sequence identifiers that are prior to such second sequence identifier; and decrementing from the total request time value and from the total network time value the time values of each of the deleted display requests, wherein transmitting the encoded display request to the display engine includes a color quality data transformation including: selecting a quality level to apply to a set of image data having a number of significant color bits defining an initial number of possible colors; applying a pixel mask to the set of image data, the initial number of possible colors reduced to a smaller number of possible colors as a function of the quality level; loading the set of image data into an output buffer; and sending the set of image data from the output buffer to the display engine.
 57. The method of claim 56, further comprising applying another pixel mask to the set of image data, the another pixel mask calculating a way point for each of the reduced number of possible colors as a function of the quality level and the initial number of possible colors.
 58. The method of claim 57, wherein the way point is a mid-way point.
 59. The method of claim 57, wherein the way point is not a mid-way point.
 60. The method of claim 56, further comprising applying a level of image compression to the set of image data.
 61. The method of claim 60, wherein the level of image compression is defined by the use of at least one technique selected from the group consisting of RLE, Basic HexTile and Advanced HexTile.
 62. The method of claim 56, further comprising applying a general packet compressor to the set of image data.
 63. The method of claim 62, wherein the general packet compressor includes at least one member selected from the group consisting of fixed level Zlib and variable level Zlib.
 64. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 56. 65. An electronic media, comprising a program for performing the method of claim
 56. 66. An apparatus for performing the method of claim
 56. 67. The method of claim 56 wherein the relative cost comprises a predetermined fixed basic operation cost and a localized per pixel cost based on a performance factor calculated for the client device.
 68. The method of claim 56 wherein the optimization of the first queue further comprises the step of performing a pruning optimization prior to performing the step of optimization.
 69. The method of claim 68 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 70. The method of claim 55 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 71. The method of claim 56 wherein the encoding further comprises the steps of performing coordinate compression; performing run length encoding compression; serializing the coordinate compressed and run length encode compressed request into fixed byte ordered strings; performing delta compression; and performing Zlib compression.
 72. The method of claim 56 wherein the encoding further comprises the steps of: omitting the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine greater than about 300 Kbytes per second; applying the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine is less than about 300 Kbytes per second; omitting Zlib compression if the bandwidth of the connection to the display engine is greater than about 300 Kbytes per second; setting the Zlib compression to its lowest and quickest compression level if the bandwidth of the connection to the display engine is between about 100 Kbytes to about 300 Kbytes per second; setting the Zlib compression to a midrange compression level between the lowest and highest compression levels if the bandwidth of the connection to the display engine is between about 3 Kbytes to about 100 Kbytes per second; and setting the Zlib compression to its highest compression level if the bandwidth of the connection to the display engine is less than about 3 Kbytes per second.
 73. The method of claim 56 further comprising: periodically updating the client device local performance factor parameter and using the updated performance factor to update the request times of pending requests received after the updating has occurred; on moving a pending request from the first queue to the second queue adding to the request an time estimate of the time when that request should be removed from the second queue based on the updated local performance factor; on removing the request from the second queue, maintaining a running average and variance for the percentage error for the estimated time as compared to the actual time that the request was removed, and, if the total of the average error minus half of the variance exceeds a pre-set limit and the time since the last update is more then 1 minute then immediately repeating the steps of updating the connection parameters and the client device local performance factor parameter.
 74. The method of claim 56 wherein the updated local performance is used to update the request times of the requests in the first and second queues.
 75. The method of claim 56 wherein the predetermined first value is about five seconds, the predetermined second value is about two seconds, and the predetermined third value is about {fraction (1/20)} of the predetermined first value.
 76. A method, comprising a packet shaping data structure transformation including: if i) a total network time, defined by a total time of requests in a pending request queue, is equal to or greater than a current round trip time, defined by twice a current latency, and ii) a total request time, defined by a sum of a total time of requests in the pending request queue and a total time of requests in a transmitted request queue, minus the total network time is equal to or less than half a preset limit, then forming a shaped packet by associating a first data portion with a second data portion and a header.
 77. The method of claim 76, further comprising routing the shaped packet to a client device via the transmitted request queue.
 78. The method of claim 76, further comprising storing the shaped packet in a shaped packet buffer.
 79. The method of claim 78, further comprising routing the shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 80. The method of claim 78, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 81. The method of claim 78, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 82. The method of claim 76, further comprising forming another shaped packet by associating a third data portion with a fourth data portion and another header.
 83. The method of claim 82, further comprising routing the shaped packet and the another shaped packet to a client device via the transmitted request queue.
 84. The method of claim 82, further comprising storing the shaped packet and the another shaped packet in a shaped packet buffer.
 85. The method of claim 84, further comprising routing the shaped packet and the another shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 86. The method of claim 84, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 87. The method of claim 84, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 88. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 76. 89. An electronic media, comprising a program for performing the method of claim
 76. 90. An apparatus for performing the method of claim
 76. 91. In a client server network providing at least one application service for selection by a user via a client device, a method for transmitting to and displaying on the display device of the client device display requests of the requested application service which are not supported by the client device, comprising: downloading from the server and executing on the client device a display engine; initializing a protocol engine with parameters of the client device comprising display operations supported by the client device, the relative cost of each supported operation and a local performance factor and parameters of the connection from the server to the display engine comprising bandwidth and latency; executing on the server the protocol engine comprising the steps of: maintaining a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device; each request having a corresponding relative cost and request time determined by the relative cost and the local performance factor; maintaining a total request time for all requests in both queues and maintaining a total network time for all requests in the second queue; while the total request time is less than a predetermined first value: accepting a new pending request from the application service; executing the new pending display request to create an image to be displayed on the client device, saving the resulting image to memory and determining for the image its relative cost and its corresponding request time based the local performance factor; converting the new pending display request from the application service into a sequence of converted requests that are supported by the client device, placing the sequence of converted requests in the first queue, determining for each converted display request in the sequence its relative cost and its corresponding request time based on the local performance factor, and incrementing the total request time by the request time of each added request; while the total network time is less than a predetermined second value: optimizing the first queue using a merge optimization when the request times of the pending requests in the first queue exceed a predetermined third value and updating the total request time based on the results of the merge optimization; reading a pending request from the first queue and labeling each read request with a first sequence identifier; encoding each read display request for transmission to the display engine; placing a copy of the optimized request into the second queue, incrementing the total network time by the request time for the newly added request, and transmitting the encoded display request to the display engine; executing the display engine comprising the steps of: unencoding the received converted display request and displaying it on the client device; generating a second sequence identifier corresponding to first sequence identifier of the displayed request; and periodically transmitting to the protocol engine the second sequence identifier of the last received display request displayed on the client device; and upon receipt of the second sequence identifier, the protocol engine further comprising the steps of: deleting from the second queue the display request whose first sequence identifier is the same as the second sequence identifier and all pending displayed requests in the second queue having first sequence identifiers that are prior to such second sequence identifier; and decrementing from the total request time and from the total network time the request time values of each of the deleted display requests, wherein transmitting the encoded display request to the display engine includes a packet shaping data structure transformation including: if i) the total network time is equal to or greater than a current round trip time, defined by twice a current latency, and ii) the total request time minus the total network time is equal to or less than half a preset limit, then forming a shaped packet by associating a first data portion with a second data portion and a header.
 92. The method of claim 91, further comprising routing the shaped packet to a client device via the transmitted request queue.
 93. The method of claim 91, further comprising storing the shaped packet in a shaped packet buffer.
 94. The method of claim 93, further comprising routing the shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 95. The method of claim 93, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 96. The method of claim 93, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 97. The method of claim 91, further comprising forming another shaped packet by associating a third data portion with a fourth data portion and another header.
 98. The method of claim 97, further comprising routing the shaped packet and the another shaped packet to a client device via the transmitted request queue.
 99. The method of claim 97, further comprising storing the shaped packet and the another shaped packet in a shaped packet buffer.
 100. The method of claim 99, further comprising routing the shaped packet and the another shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 101. The method of claim 99, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 102. The method of claim 99, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 103. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 91. 104. An electronic media, comprising a program for performing the method of claim
 91. 105. An apparatus for performing the method of claim
 91. 106. The method of claim 91 wherein the relative cost for a request comprises a predetermined fixed basic operation cost and a localized cost per pixel calculated for the client device.
 107. The method of claim 91 wherein the optimization of the first queue further comprises the step of performing a pruning optimization prior to performing the merge optimization.
 108. The method of claim 107 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 109. The method of claim 91 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 110. The method of claim 91 wherein the encoding further comprises the steps of performing coordinate compression; performing run length encoding compression; serializing the coordinate compressed and run length encoded compressed request into fixed byte ordered strings; performing delta compression; and performing Zlib compression.
 111. The method of claim 110 wherein the encoding further comprises the steps of: omitting the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine greater than about 300 Kbytes per second; applying the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine is less than about 300 Kbytes per second; omitting Zlib compression if the bandwidth of the connection to the display engine is greater than about 300 Kbytes per second; setting the ZLib compression to its lowest and quickest compression level if the bandwidth of the connection to the display engine is between about 100 Kbytes to about 300 Kbytes per second; setting the ZLib compression to a midrange compression level between its highest and lowest compression levels if the bandwidth of the connection to the display engine is between about 3 Kbytes to about 100 Kbytes per second; and setting the ZLib compression to its highest compression level if the bandwidth of the connection to the display engine is less than about 3 Kbytes per second.
 112. The method of claim 91 further comprising: periodically updating the of bandwidth and latency parameters; and using the updated parameters to determine the level of encoding used.
 113. The method of claim 91 further comprising: periodically updating the bandwidth and latency parameters; and using the updated parameters to determine the level of encoding used.
 114. The method of claim 91 further comprising: periodically updating the client device local performance factor and using the updated performance factor to determine the request times of pending requests received after the updating has occurred; on moving a pending request from the first queue to the second queue adding to the request an time estimate of the time when that request should be removed from the second queue based on the updated local performance factor; on removing the request from the second queue, maintaining a running average and variance for the percentage error for the estimated time as compared to the actual time that the request was removed, and, if the total of the average error minus half of the variance exceeds a pre-set limit and the time since the last update is more then one minute then immediately repeating the steps of updating the connection parameters and the client device local performance factor parameter.
 115. The method of claim 91 wherein the updated local performance is used to update the request times of the requests in the first and second queues.
 116. The method of claim 91 wherein the predetermined first value is about five seconds, the predetermined second value is about two seconds, and the predetermined third value is about {fraction (1/20)} of the predetermined first value.
 117. In a client server network providing at least one application service for selection by a user via a client device having a display engine operating thereon, a method for converting, transmitting, and displaying requests of the requested application service that are not supported by the client device, comprising: downloading from the server and executing on the client device a display engine associated with the application service requested by the user; loading on a server in the network a protocol engine in communication with the display engine and the requested application service; using the display engine to determine parameters of the client device comprising display operations supported by the client device, the relative cost of each supported operation and a local performance factor and parameters of the connection from the server to the display engine comprising bandwidth and latency; transmitting to and initializing the protocol engine with the client device parameters and the connection parameters; executing the protocol engine comprising the steps of: maintaining a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device; each request having a corresponding relative cost and request time determined by the relative cost and the local performance factor; maintaining a total request time for all requests in both queues and maintaining a total network time for all requests in the second queue; while the total request time is less than a predetermined first value: accepting from the application service a new pending display request to be displayed on the client device; executing the new pending display request to create an image to be displayed on a portion of a display screen of a client device, saving the resulting image to memory, and determining for the image its relative cost and its corresponding request time based the local performance factor; converting, based on the support display operations of the client device, the new pending display request into a sequence of converted requests that are supported by the client device, placing the sequence of converted requests in the first queue, determining for each converted display request its relative cost and its corresponding request time based on the local performance factor, and incrementing the total request time by the request time of each converted request added to the first queue; while the total network time is less than a predetermined second value: optimizing the first queue using a merge optimization when the request times of the pending requests in the first queue exceed a predetermined third value and updating the total request time based on the results of the merge optimization; reading a pending request from the first queue and labeling each read request with a first sequence identifier; encoding each read display request for transmission to the display engine; placing a copy of the optimized request into the second queue and incrementing the total network time value for the newly added request; and transmitting the encoded display request to the display engine; executing the display engine comprising the steps of: unencoding the received converted display request and displaying it on the client device; generating a second sequence identifier corresponding to first sequence identifier of the displayed request; and periodically transmitting to the protocol engine the second sequence identifier of the last received display request displayed on the client device; and upon receipt of the second sequence identifier of the last displayed display request, the protocol engine further comprising the steps of: deleting from the second queue the display request whose first sequence identifier is the same as the second sequence identifier and all pending displayed requests in the second queue having identifiers that are prior to such second sequence unique identifier; and decrementing from the total request time and from the total network time the request time values of each of the deleted display requests, wherein transmitting the encoded display request to the display engine includes a packet shaping data structure transformation including: if i) the total network time is equal to or greater than a current round trip time, defined by twice a current latency, and ii) the total request time minus the total network time is equal to or less than half a preset limit, then forming a shaped packet by associating a first data portion with a second data portion and a header.
 118. The method of claim 117, further comprising routing the shaped packet to a client device via the transmitted request queue.
 119. The method of claim 117, further comprising storing the shaped packet in a shaped packet buffer.
 120. The method of claim 119, further comprising routing the shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 121. The method of claim 119, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 122. The method of claim 119, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 123. The method of claim 117, further comprising forming another shaped packet by associating a third data portion with a fourth data portion and another header.
 124. The method of claim 123, further comprising routing the shaped packet and the another shaped packet to a client device via the transmitted request queue.
 125. The method of claim 123, further comprising storing the shaped packet and the another shaped packet in a shaped packet buffer.
 126. The method of claim 125, further comprising routing the shaped packet and the another shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 127. The method of claim 125, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 128. The method of claim 125, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 129. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 117. 130. An electronic media, comprising a program for performing the method of claim
 117. 131. An apparatus for performing the method of claim
 117. 132. The method of claim 117 wherein the relative cost comprises a predetermined fixed basic operation cost and a localized cost per pixel calculated for the client device.
 133. The method of claim 117 wherein the optimization of the first queue further comprises the step of performing a pruning optimization prior to performing the merge optimization.
 134. The method of claim 133 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 135. The method of claim 117 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 136. The method of claim 117 wherein the encoding further comprises the steps of: performing coordinate compression; performing run length encoding compression; serializing the coordinate compressed and run length encode compressed request into fixed byte ordered strings; performing delta compression; and performing Zlib compression.
 137. The method of claim 136 wherein the encoding further comprises the steps of: omitting the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine greater than about 300 Kbytes per second; applying the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine is less than about 300 Kbytes per second; omitting Zlib compression if the bandwidth of the connection to the display engine is greater than about 300 Kbytes per second; setting the ZLib compression to its lowest and quickest compression level if the bandwidth of the connection to the display engine is between about 100 Kbytes to about 300 Kbytes per second; setting the ZLib compression to a midrange compression level between its highest and lowest compression levels if the bandwidth of the connection to the display engine is between about 3 Kbytes to about 100 Kbytes per second; and setting the ZLib compression to its highest compression level if the bandwidth of the connection to the display engine is less than about 3 Kbytes per second.
 138. The method of claim 137 further comprising: periodically updating the bandwidth and latency parameters; and using the updated connection parameters to determine the level of encoding used.
 139. The method of claim 117 further comprising: periodically updating the bandwidth and latency parameters; and using the updated parameters to determine the level of encoding used.
 140. The method of claim 137 further comprising: periodically updating the client device local performance factor parameter and using the updated performance factor to update the request times of pending requests received after the updating has occurred; on moving a pending request from the first queue to the second queue adding to the request an time estimate of the time when that request should be removed from the second queue based on the updated local performance factor; on removing the request from the second queue, maintaining a running average and variance for the percentage error for the estimated time as compared to the actual time that the request was removed, and, if the total of the average error minus half of the variance exceeds a pre-set limit and the time since the last update is more then 1 minute then immediately repeating the steps of updating the connection parameters and the client device local performance factor parameter.
 141. The method of claim 137 wherein the updated local performance is used to update the request times of the requests in the first and second queues.
 142. The method of claim 117 wherein the predetermined first value is about five seconds, the predetermined second value is about two seconds, and the predetermined third value is about {fraction (1/20)} of the predetermined first value.
 143. In a client server network providing at least one application service for selection by a user via a client device, a method for transmitting to and displaying on the display device of the client device display requests of the requested application service which are not supported by the client device, comprising: downloading from the server and executing on the client device a display engine associated with the application service requested by the user; loading on a server in the network a protocol engine in communication with the display engine and the requested application service; providing to the display a table of display operations expected to be supported by the client device on which the display engine is executing; using the display engine to determine parameters of the client device comprising: testing the operation of each of the expected display operations on the client device and modifying the table to indicate which of the expected display operations was successfully tested; determining a local performance factor for the client device; and determining parameters of the connection from the server to the display engine comprising bandwidth and latency; transmitting to and initializing the protocol engine with the client device parameters and the connection parameters as determined by the display engine; executing the protocol engine comprising the steps of: maintaining a first queue for retaining pending display requests and a second queue for retaining transmitted display requests of the requested application service for display on the client device; each request having a corresponding relative cost and request time determined by the relative cost and the local performance factor; maintaining a total request time for all requests in both queues and maintaining a total network time for all requests in the second queue; while the total request time is less than a predetermined first value: accepting from the application service a new pending display request to be displayed on the client device; executing the new pending display request to create an image to be displayed on a portion of a display screen of a client device, saving the resulting image to memory, and determining for the image its relative cost and its corresponding request time based the local performance factor; converting, based on the support display operations of the client device, the new pending display request into a sequence of converted requests that are supported by the client device, placing the sequence of converted requests in the first queue, determining for each converted display request its relative cost and its corresponding request time based on the local performance factor, and incrementing the total request time by the request time of each converted request added to the first queue; while the total network time is less than a predetermined second value: optimizing the first queue when the request times of the pending requests in the first queue exceed a predetermined third value by comparing the relative cost of the image to the sum of the relative costs of pending converted display requests in the first queue intended for display on the same portion of the display device of the client device as the image, and, if the relative cost of the image is less than the sum of the relative costs of the compared pending display requests:  converting the image into a converted image request and determining its relative cost and its request time based on the local performance factor;  replacing in the first queue the compared pending converted display requests with the converted image display request; and  adjusting the total request time to reflect the addition of the converted image request and removal of the compared pending requests in the first queue; reading a pending request from the first queue and labeling each read request with a first sequence identifier; encoding each read display request for transmission to the display engine based on the bandwidth of the connection; placing a copy of the optimized request into the second queue and incrementing the total network time value for the newly added request; and transmitting the encoded display request to the display engine; using the display engine to process the received encoded display requests comprising the steps of: unencoding the converted display request and displaying it on the client device; generating a second sequence identifier corresponding to first sequence identifier of the displayed request; and periodically transmitting to the protocol engine the second sequence identifier of the last display request displayed on the client device; and upon receipt of the second sequence identifier of the last displayed display request, the protocol engine further comprising the steps of: deleting from the second queue the display request whose first sequence identifier is equal to the second sequence identifier and all pending displayed requests in the second queue having first sequence identifiers that are prior to such second sequence identifier; and decrementing from the total request time value and from the total network time value the time values of each of the deleted display requests, wherein transmitting the encoded display request to the display engine includes a packet shaping data structure transformation including: if i) the total network time is equal to or greater than a current round trip time, defined by twice a current latency, and ii) the total request time minus the total network time is equal to or less than half a preset limit, then forming a shaped packet by associating a first data portion with a second data portion and a header.
 144. The method of claim 143, further comprising routing the shaped packet to a client device via the transmitted request queue.
 145. The method of claim 143, further comprising storing the shaped packet in a shaped packet buffer.
 146. The method of claim 145, further comprising routing the shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 147. The method of claim 145, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 148. The method of claim 145, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 149. The method of claim 143, further comprising forming another shaped packet by associating a third data portion with a fourth data portion and another header.
 150. The method of claim 149, further comprising routing the shaped packet and the another shaped packet to a client device via the transmitted request queue.
 151. The method of claim 149, further comprising storing the shaped packet and the another shaped packet in a shaped packet buffer.
 152. The method of claim 151, further comprising routing the shaped packet and the another shaped packet from the shaped packet buffer to a client device when a capacity of the shaped packet buffer is reached.
 153. The method of claim 151, further comprising routing the shaped packet from the shaped packet buffer to a client device when i) the total network time is less than the current round trip time or ii) the total request time minus the total network time is greater than half the preset limit.
 154. The method of claim 151, further comprising routing the shaped packet from the shaped packet buffer to a client device after a period of time has passed.
 155. A computer program, comprising computer or machine readable program elements translatable for implementing the method of claim
 143. 156. An electronic media, comprising a program for performing the method of claim
 143. 157. An apparatus for performing the method of claim
 143. 158. The method of claim 143 wherein the relative cost comprises a predetermined fixed basic operation cost and a localized per pixel cost based on a performance factor calculated for the client device.
 159. The method of claim 143 wherein the optimization of the first queue further comprises the step of performing a pruning optimization prior to performing the step of optimization.
 160. The method of claim 159 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 161. The method of claim 142 wherein the optimization of the first queue further comprises performing an update scheduling optimization and an attribute scheduling optimization.
 162. The method of claim 143 wherein the encoding further comprises the steps of performing coordinate compression; performing run length encoding compression; serializing the coordinate compressed and run length encode compressed request into fixed byte ordered strings; performing delta compression; and performing Zlib compression.
 163. The method of claim 143 wherein the encoding further comprises the steps of: omitting the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine greater than about 300 Kbytes per second; applying the steps of run length encoding and delta compression if the bandwidth of the connection to the display engine is less than about 300 Kbytes per second; omitting Zlib compression if the bandwidth of the connection to the display engine is greater than about 300 Kbytes per second; setting the Zlib compression to its lowest and quickest compression level if the bandwidth of the connection to the display engine is between about 100 Kbytes to about 300 Kbytes per second; setting the Zlib compression to a midrange compression level between the lowest and highest compression levels if the bandwidth of the connection to the display engine is between about 3 Kbytes to about 100 Kbytes per second; and setting the Zlib compression to its highest compression level if the bandwidth of the connection to the display engine is less than about 3 Kbytes per second.
 164. The method of claim 143 further comprising: periodically updating the client device local performance factor parameter and using the updated performance factor to update the request times of pending requests received after the updating has occurred; on moving a pending request from the first queue to the second queue adding to the request an time estimate of the time when that request should be removed from the second queue based on the updated local performance factor; on removing the request from the second queue, maintaining a running average and variance for the percentage error for the estimated time as compared to the actual time that the request was removed, and, if the total of the average error minus half of the variance exceeds a pre-set limit and the time since the last update is more then 1 minute then immediately repeating the steps of updating the connection parameters and the client device local performance factor parameter.
 165. The method of claim 143 wherein the updated local performance is used to update the request times of the requests in the first and second queues.
 166. The method of claim 143 wherein the predetermined first value is about five seconds, the predetermined second value is about two seconds, and the predetermined third value is about {fraction (1/20)} of the predetermined first value. 